tla-ts 0.0.3 → 0.0.4-dev.1a3acf6
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.
- package/README.md +46 -115
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +194 -8
- package/dist/index.d.ts +194 -8
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +1006 -0
- package/dist/prove.js +1006 -0
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +1377 -18
- package/dist/transfer.js +1377 -18
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +24 -11
- package/src/ast.ts +149 -8
- package/src/bags.ts +26 -30
- package/src/builtins.ts +45 -19
- package/src/bundled-modules.ts +3 -3
- package/src/check.ts +1182 -900
- package/src/cli/options.ts +109 -0
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/cli/tlc.ts +941 -0
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +9 -2
- package/src/codegen.ts +112 -51
- package/src/config.ts +254 -181
- package/src/dependencies.ts +5 -7
- package/src/environment.ts +579 -184
- package/src/errors.ts +287 -4
- package/src/evaluate.ts +1095 -365
- package/src/exit-codes.ts +22 -43
- package/src/fingerprints.ts +49 -14
- package/src/index.ts +11 -0
- package/src/instances.ts +73 -60
- package/src/java-overrides.ts +183 -66
- package/src/json.ts +31 -36
- package/src/levels.ts +197 -54
- package/src/lexer.ts +127 -30
- package/src/liveness-checker.ts +894 -0
- package/src/liveness.ts +246 -596
- package/src/{obligation-action.ts → obligations/action.ts} +248 -74
- package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +618 -0
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/obligations/generate.ts +457 -0
- package/src/{obligations.ts → obligations/index.ts} +46 -32
- package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
- package/src/obligations/module.ts +445 -0
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +195 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/obligations/regroup.ts +100 -0
- package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
- package/src/{obligation-source.ts → obligations/source.ts} +174 -216
- package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +184 -235
- package/src/parallel.ts +156 -91
- package/src/parser.ts +490 -188
- package/src/pcal/ast.ts +755 -0
- package/src/pcal/parse.ts +1487 -0
- package/src/pcal/tokenize.ts +487 -0
- package/src/pcal/translate.ts +1151 -0
- package/src/pcal/validate.ts +444 -0
- package/src/prover/decide-pool.ts +95 -0
- package/src/prover/deciders.ts +33 -0
- package/src/prover/first-order.ts +175 -0
- package/src/prover/isabelle/LICENSE +36 -0
- package/src/prover/isabelle/LICENSE-tlapm +26 -0
- package/src/prover/isabelle/decide.ts +44 -0
- package/src/prover/isabelle/encode.ts +445 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prover/isabelle/isar/method.ts +367 -0
- package/src/prover/isabelle/isar/proof.ts +28 -0
- package/src/prover/isabelle/isar/statement.ts +57 -0
- package/src/prover/isabelle/isar/theory.ts +192 -0
- package/src/prover/isabelle/isar/type-check.ts +278 -0
- package/src/prover/isabelle/provers/blast/blast.ts +258 -0
- package/src/prover/isabelle/provers/blast/branch.ts +322 -0
- package/src/prover/isabelle/provers/blast/prove.ts +347 -0
- package/src/prover/isabelle/provers/blast/rules.ts +330 -0
- package/src/prover/isabelle/provers/blast/state.ts +180 -0
- package/src/prover/isabelle/provers/blast/term.ts +546 -0
- package/src/prover/isabelle/provers/clasimp.ts +150 -0
- package/src/prover/isabelle/provers/classical.ts +389 -0
- package/src/prover/isabelle/provers/hypsubst.ts +433 -0
- package/src/prover/isabelle/pure/bicompose.ts +174 -0
- package/src/prover/isabelle/pure/consts.ts +32 -0
- package/src/prover/isabelle/pure/conv.ts +79 -0
- package/src/prover/isabelle/pure/drule.ts +264 -0
- package/src/prover/isabelle/pure/envir.ts +331 -0
- package/src/prover/isabelle/pure/goal.ts +53 -0
- package/src/prover/isabelle/pure/interrupt.ts +16 -0
- package/src/prover/isabelle/pure/list.ts +12 -0
- package/src/prover/isabelle/pure/logic.ts +330 -0
- package/src/prover/isabelle/pure/name.ts +98 -0
- package/src/prover/isabelle/pure/net.ts +215 -0
- package/src/prover/isabelle/pure/object-logic.ts +41 -0
- package/src/prover/isabelle/pure/pattern.ts +631 -0
- package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prover/isabelle/pure/rewriter.ts +602 -0
- package/src/prover/isabelle/pure/search.ts +68 -0
- package/src/prover/isabelle/pure/seq.ts +133 -0
- package/src/prover/isabelle/pure/simplifier.ts +106 -0
- package/src/prover/isabelle/pure/table.ts +201 -0
- package/src/prover/isabelle/pure/tactic.ts +168 -0
- package/src/prover/isabelle/pure/tactical.ts +264 -0
- package/src/prover/isabelle/pure/term-ord.ts +105 -0
- package/src/prover/isabelle/pure/term.ts +688 -0
- package/src/prover/isabelle/pure/thm.ts +783 -0
- package/src/prover/isabelle/pure/type.ts +121 -0
- package/src/prover/isabelle/pure/unify.ts +753 -0
- package/src/prover/isabelle/pure/variable.ts +25 -0
- package/src/prover/isabelle/tla/classical-setup.ts +101 -0
- package/src/prover/isabelle/tla/context.ts +74 -0
- package/src/prover/isabelle/tla/logic-data.ts +5 -0
- package/src/prover/isabelle/tla/logic.ts +215 -0
- package/src/prover/isabelle/tla/simpdata.ts +241 -0
- package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prover/ocaml.ts +22 -0
- package/src/prover/prep/action.ts +508 -0
- package/src/prover/prep/enabled-axioms.ts +189 -0
- package/src/prover/prep/fingerprint.ts +388 -0
- package/src/prover/prep/level-comparison.ts +529 -0
- package/src/prover/prep/md5.ts +60 -0
- package/src/prover/prep/methods.ts +221 -0
- package/src/prover/prep/normalize.ts +309 -0
- package/src/prover/prove-worker.ts +22 -0
- package/src/prover/prove.ts +492 -0
- package/src/prover/ptl/decide.ts +68 -0
- package/src/prover/ptl/encode.ts +244 -0
- package/src/prover/ptl/sat.ts +151 -0
- package/src/prover/ptl/tableau.ts +276 -0
- package/src/prover/smt/axioms.ts +209 -0
- package/src/prover/smt/context.ts +108 -0
- package/src/prover/smt/data.ts +636 -0
- package/src/prover/smt/encode.ts +275 -0
- package/src/prover/smt/extensionality.ts +65 -0
- package/src/prover/smt/flatten.ts +112 -0
- package/src/prover/smt/format.ts +154 -0
- package/src/prover/smt/instances.ts +181 -0
- package/src/prover/smt/rewrite.ts +766 -0
- package/src/prover/smt/solver/act-cache.ts +265 -0
- package/src/prover/smt/solver/arith-rewriter.ts +962 -0
- package/src/prover/smt/solver/array.ts +22 -0
- package/src/prover/smt/solver/asserted-formulas.ts +469 -0
- package/src/prover/smt/solver/ast-lt.ts +157 -0
- package/src/prover/smt/solver/ast-util.ts +91 -0
- package/src/prover/smt/solver/ast.ts +1315 -0
- package/src/prover/smt/solver/auf-solver.ts +572 -0
- package/src/prover/smt/solver/case-split-queue.ts +178 -0
- package/src/prover/smt/solver/cg-table.ts +175 -0
- package/src/prover/smt/solver/clause.ts +276 -0
- package/src/prover/smt/solver/conflict-resolution.ts +343 -0
- package/src/prover/smt/solver/context.ts +1292 -0
- package/src/prover/smt/solver/ctx-simplify.ts +334 -0
- package/src/prover/smt/solver/der.ts +224 -0
- package/src/prover/smt/solver/dyn-ack.ts +141 -0
- package/src/prover/smt/solver/e-matching.ts +659 -0
- package/src/prover/smt/solver/enode.ts +259 -0
- package/src/prover/smt/solver/expr-ref.ts +21 -0
- package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prover/smt/solver/fingerprints.ts +92 -0
- package/src/prover/smt/solver/flat-literals.ts +51 -0
- package/src/prover/smt/solver/goal.ts +138 -0
- package/src/prover/smt/solver/hash.ts +173 -0
- package/src/prover/smt/solver/hashtable.ts +166 -0
- package/src/prover/smt/solver/internalizer.ts +1381 -0
- package/src/prover/smt/solver/lbool.ts +5 -0
- package/src/prover/smt/solver/literal.ts +24 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prover/smt/solver/lp/constraints.ts +78 -0
- package/src/prover/smt/solver/lp/containers.ts +296 -0
- package/src/prover/smt/solver/lp/core-solver.ts +504 -0
- package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prover/smt/solver/lp/dependency.ts +51 -0
- package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prover/smt/solver/lp/explanation.ts +46 -0
- package/src/prover/smt/solver/lp/gomory.ts +255 -0
- package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prover/smt/solver/lp/hnf.ts +281 -0
- package/src/prover/smt/solver/lp/int-cube.ts +295 -0
- package/src/prover/smt/solver/lp/int-solver.ts +514 -0
- package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prover/smt/solver/lp/lar-term.ts +62 -0
- package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prover/smt/solver/lp/nex.ts +120 -0
- package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prover/smt/solver/lp/nla-core.ts +968 -0
- package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prover/smt/solver/lp/nla-order.ts +307 -0
- package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prover/smt/solver/lp/nla-types.ts +124 -0
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prover/smt/solver/lp/pdd.ts +971 -0
- package/src/prover/smt/solver/lp/random-updater.ts +138 -0
- package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prover/smt/solver/lp/union-find.ts +96 -0
- package/src/prover/smt/solver/mam-compiler.ts +847 -0
- package/src/prover/smt/solver/mam-interpreter.ts +400 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prover/smt/solver/model-checker.ts +347 -0
- package/src/prover/smt/solver/model-evaluator.ts +262 -0
- package/src/prover/smt/solver/model-finder.ts +155 -0
- package/src/prover/smt/solver/model-generator.ts +97 -0
- package/src/prover/smt/solver/model-macro-solver.ts +728 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prover/smt/solver/nlsat/explain.ts +607 -0
- package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prover/smt/solver/nlsat/solver.ts +911 -0
- package/src/prover/smt/solver/nlsat/types.ts +43 -0
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prover/smt/solver/nnf.ts +469 -0
- package/src/prover/smt/solver/pattern-inference.ts +351 -0
- package/src/prover/smt/solver/poly-rewriter.ts +477 -0
- package/src/prover/smt/solver/propagate-values.ts +83 -0
- package/src/prover/smt/solver/proto-model.ts +551 -0
- package/src/prover/smt/solver/pull-quant.ts +139 -0
- package/src/prover/smt/solver/qe-lite-der.ts +526 -0
- package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prover/smt/solver/qe-lite.ts +381 -0
- package/src/prover/smt/solver/qi-queue.ts +362 -0
- package/src/prover/smt/solver/quant-tactics.ts +117 -0
- package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prover/smt/solver/quantifier-manager.ts +186 -0
- package/src/prover/smt/solver/random-gen.ts +10 -0
- package/src/prover/smt/solver/rational.ts +165 -0
- package/src/prover/smt/solver/ref-vector.ts +62 -0
- package/src/prover/smt/solver/relevancy.ts +247 -0
- package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prover/smt/solver/rewriter.ts +843 -0
- package/src/prover/smt/solver/rlimit.ts +79 -0
- package/src/prover/smt/solver/smtlib-parser.ts +526 -0
- package/src/prover/smt/solver/solver.ts +71 -0
- package/src/prover/smt/solver/sort.ts +35 -0
- package/src/prover/smt/solver/sticky-generations.ts +69 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prover/smt/solver/theory-lra-model.ts +243 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prover/smt/solver/theory-lra-state.ts +43 -0
- package/src/prover/smt/solver/theory-lra.ts +56 -0
- package/src/prover/smt/solver/var-subst.ts +258 -0
- package/src/prover/smt/solver/z3-license.txt +10 -0
- package/src/prover/smt/table.ts +170 -0
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/prover/tlapm/tlapm.ts +96 -0
- package/src/prover/tlaps-module.ts +510 -0
- package/src/prover/verdict.ts +13 -0
- package/src/prover/zenon/LICENSE +32 -0
- package/src/prover/zenon/check/check.ts +105 -0
- package/src/prover/zenon/check/definitions.ts +144 -0
- package/src/prover/zenon/check/equality.ts +182 -0
- package/src/prover/zenon/check/functions.ts +62 -0
- package/src/prover/zenon/check/keys.ts +125 -0
- package/src/prover/zenon/check/propositional.ts +104 -0
- package/src/prover/zenon/check/records.ts +188 -0
- package/src/prover/zenon/check/relations.ts +121 -0
- package/src/prover/zenon/check/rewrites.ts +224 -0
- package/src/prover/zenon/check/sets.ts +302 -0
- package/src/prover/zenon/check/terms.ts +127 -0
- package/src/prover/zenon/check/tla.ts +126 -0
- package/src/prover/zenon/decide.ts +107 -0
- package/src/prover/zenon/encode.ts +378 -0
- package/src/prover/zenon/eqrel.ts +300 -0
- package/src/prover/zenon/equality-rules.ts +435 -0
- package/src/prover/zenon/expr.ts +551 -0
- package/src/prover/zenon/index-table.ts +350 -0
- package/src/prover/zenon/isar-case.ts +513 -0
- package/src/prover/zenon/isar.ts +1249 -0
- package/src/prover/zenon/limits.ts +15 -0
- package/src/prover/zenon/llproof.ts +173 -0
- package/src/prover/zenon/mltoll.ts +1566 -0
- package/src/prover/zenon/node.ts +297 -0
- package/src/prover/zenon/ocaml.ts +169 -0
- package/src/prover/zenon/parse.ts +247 -0
- package/src/prover/zenon/phrase.ts +191 -0
- package/src/prover/zenon/proof.ts +198 -0
- package/src/prover/zenon/propositional-rules.ts +387 -0
- package/src/prover/zenon/rules.ts +94 -0
- package/src/prover/zenon/search.ts +288 -0
- package/src/prover/zenon/tla/functions.ts +151 -0
- package/src/prover/zenon/tla/llproof.ts +480 -0
- package/src/prover/zenon/tla/records.ts +225 -0
- package/src/prover/zenon/tla/rewrites.ts +447 -0
- package/src/prover/zenon/tla/sets.ts +304 -0
- package/src/prover/zenon/tla/terms.ts +162 -0
- package/src/prover/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +39 -27
- package/src/resolve.ts +1474 -426
- package/src/runtime.ts +25 -7
- package/src/sany/builtins.ts +147 -0
- package/src/sany/generator.ts +3111 -0
- package/src/sany/levels.ts +1205 -0
- package/src/sany/lexer.ts +544 -0
- package/src/sany/linter.ts +122 -0
- package/src/sany/modules.ts +1398 -0
- package/src/sany/nodes.ts +463 -0
- package/src/sany/parse-error.ts +2161 -0
- package/src/sany/report.ts +355 -0
- package/src/sany/selectors.ts +736 -0
- package/src/sany/source.ts +247 -0
- package/src/sany/xml.ts +1016 -0
- package/src/search.ts +969 -0
- package/src/spec-description.ts +66 -29
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +215 -164
- package/src/state-graph.ts +181 -0
- package/src/subexpressions.ts +231 -171
- package/src/substitution-levels.ts +40 -19
- package/src/successors.ts +253 -125
- package/src/symmetry.ts +194 -54
- package/src/tableau.ts +60 -32
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-modules.ts → tlc/jar-data.ts} +4 -0
- package/src/tlc/messages.ts +441 -0
- package/src/{tlc-order.ts → tlc/order.ts} +84 -16
- package/src/{tlc-random.ts → tlc/random.ts} +30 -189
- package/src/tlc/replay.ts +659 -0
- package/src/{tlc-summary.ts → tlc/summary.ts} +20 -5
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +59 -50
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +63 -45
- package/src/tlc/version.ts +19 -0
- package/src/transfer.ts +44 -32
- package/src/values.ts +843 -241
- package/src/worker.ts +62 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -28
- package/dist/run-cli.js +0 -28
- package/src/canonical.ts +0 -39
- package/src/cli-options.ts +0 -58
- package/src/obligation-expression.ts +0 -1060
- package/src/obligation-module.ts +0 -1042
- package/src/run-cli.ts +0 -478
|
@@ -0,0 +1,186 @@
|
|
|
1
|
+
// Ported from Z3 (src/smt/smt_quantifier.cpp), MIT license, see
|
|
2
|
+
// z3-license.txt. Z3's default quantifier plugin: patterns go to an eager matcher, except that a
|
|
3
|
+
// quantifier with only multi-patterns keeps one of them eager and sends the rest to a lazy matcher
|
|
4
|
+
// that runs in the final check. With MBQI, the model finder and the model checker turn candidate
|
|
5
|
+
// models into instances.
|
|
6
|
+
import {
|
|
7
|
+
CHECK_MODEL_RESTART,
|
|
8
|
+
CHECK_MODEL_SAT,
|
|
9
|
+
CHECK_MODEL_UNKNOWN,
|
|
10
|
+
FC_CONTINUE,
|
|
11
|
+
FC_DONE,
|
|
12
|
+
type Context,
|
|
13
|
+
} from "./context";
|
|
14
|
+
import { Mam } from "./e-matching";
|
|
15
|
+
import type { Enode } from "./enode";
|
|
16
|
+
import { FingerprintSet } from "./fingerprints";
|
|
17
|
+
import { ModelChecker } from "./model-checker";
|
|
18
|
+
import { ModelFinder } from "./model-finder";
|
|
19
|
+
import type { ProtoModel } from "./proto-model";
|
|
20
|
+
import { QiQueue } from "./qi-queue";
|
|
21
|
+
|
|
22
|
+
const QI_MAX_EAGER_MULTIPATTERNS = 0;
|
|
23
|
+
const QI_MAX_LAZY_MULTIPATTERN_MATCHING = 2;
|
|
24
|
+
|
|
25
|
+
// Model-based quantifier instantiation: the finder completes candidate models, the checker refutes
|
|
26
|
+
// them with instances.
|
|
27
|
+
interface Mbqi {
|
|
28
|
+
finder: ModelFinder;
|
|
29
|
+
checker: ModelChecker;
|
|
30
|
+
}
|
|
31
|
+
|
|
32
|
+
export class DefaultQuantifierManager {
|
|
33
|
+
readonly quantifiers: number[] = [];
|
|
34
|
+
private generations = new Map<number, number>();
|
|
35
|
+
private qiQueue: QiQueue;
|
|
36
|
+
private mam: Mam;
|
|
37
|
+
private lazyMam: Mam;
|
|
38
|
+
private fingerprints: FingerprintSet;
|
|
39
|
+
private isActive = false;
|
|
40
|
+
private lazyMatchingIndex = 0;
|
|
41
|
+
private mbqi: Mbqi | null = null;
|
|
42
|
+
|
|
43
|
+
constructor(
|
|
44
|
+
private context: Context,
|
|
45
|
+
isMbqi: boolean,
|
|
46
|
+
) {
|
|
47
|
+
this.qiQueue = new QiQueue(context);
|
|
48
|
+
this.fingerprints = new FingerprintSet(context.manager);
|
|
49
|
+
const onMatch = (quantifier: number, bindings: Enode[], maxGeneration: number) =>
|
|
50
|
+
this.addInstance(quantifier, bindings, maxGeneration);
|
|
51
|
+
this.mam = new Mam(context, onMatch);
|
|
52
|
+
this.lazyMam = new Mam(context, onMatch);
|
|
53
|
+
if (!isMbqi) return;
|
|
54
|
+
const finder = new ModelFinder(context.manager, context);
|
|
55
|
+
this.mbqi = { finder, checker: new ModelChecker(context, finder, this) };
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
getNumInstances() {
|
|
59
|
+
return this.qiQueue.numInstances;
|
|
60
|
+
}
|
|
61
|
+
|
|
62
|
+
add(quantifier: number, generation: number) {
|
|
63
|
+
this.quantifiers.push(quantifier);
|
|
64
|
+
this.generations.set(quantifier, generation);
|
|
65
|
+
this.mbqi?.finder.registerQuantifier(quantifier);
|
|
66
|
+
}
|
|
67
|
+
|
|
68
|
+
del(quantifier: number) {
|
|
69
|
+
this.quantifiers.pop();
|
|
70
|
+
this.generations.delete(quantifier);
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
hasQuantifiers() {
|
|
74
|
+
return this.quantifiers.length > 0;
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
getGeneration(quantifier: number) {
|
|
78
|
+
return this.generations.get(quantifier) ?? 0;
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
assignEh(quantifier: number) {
|
|
82
|
+
this.isActive = true;
|
|
83
|
+
const manager = this.context.manager;
|
|
84
|
+
const patterns = manager
|
|
85
|
+
.getQuantifier(quantifier)
|
|
86
|
+
.patterns.map((pattern) => manager.getArgs(pattern));
|
|
87
|
+
const hasUnaryPattern = patterns.some((pattern) => pattern.length === 1);
|
|
88
|
+
const numEagerMultiPatterns = QI_MAX_EAGER_MULTIPATTERNS + (hasUnaryPattern ? 0 : 1);
|
|
89
|
+
let multiPatternIndex = 0;
|
|
90
|
+
for (const pattern of patterns) {
|
|
91
|
+
const isUnary = pattern.length === 1;
|
|
92
|
+
if (!isUnary && multiPatternIndex >= numEagerMultiPatterns)
|
|
93
|
+
this.lazyMam.addPattern(quantifier, pattern);
|
|
94
|
+
else this.mam.addPattern(quantifier, pattern);
|
|
95
|
+
if (!isUnary) multiPatternIndex++;
|
|
96
|
+
}
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
// is_shared: a ground term of a pattern, once a quantifier was asserted.
|
|
100
|
+
isShared(node: Enode) {
|
|
101
|
+
return this.isActive && (this.mam.isShared(node) || this.lazyMam.isShared(node));
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
addEqEh(first: Enode, second: Enode) {
|
|
105
|
+
if (this.quantifiers.length > 0) this.mam.addEqEh(first, second);
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
relevantEh(node: Enode) {
|
|
109
|
+
if (this.quantifiers.length === 0) return;
|
|
110
|
+
this.mam.relevantEh(node, false);
|
|
111
|
+
this.lazyMam.relevantEh(node, true);
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
push() {
|
|
115
|
+
this.mam.pushScope();
|
|
116
|
+
this.lazyMam.pushScope();
|
|
117
|
+
this.mbqi?.finder.pushScope();
|
|
118
|
+
this.qiQueue.push();
|
|
119
|
+
this.fingerprints.push();
|
|
120
|
+
}
|
|
121
|
+
|
|
122
|
+
pop(numScopes: number) {
|
|
123
|
+
this.mam.popScope(numScopes);
|
|
124
|
+
this.lazyMam.popScope(numScopes);
|
|
125
|
+
this.mbqi?.finder.popScope(numScopes);
|
|
126
|
+
this.qiQueue.pop(numScopes);
|
|
127
|
+
this.fingerprints.pop(numScopes);
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
canPropagate() {
|
|
131
|
+
return this.qiQueue.hasWork() || (this.isActive && this.mam.hasWork());
|
|
132
|
+
}
|
|
133
|
+
|
|
134
|
+
propagate() {
|
|
135
|
+
if (this.isActive) this.mam.match();
|
|
136
|
+
this.qiQueue.instantiate();
|
|
137
|
+
}
|
|
138
|
+
|
|
139
|
+
addInstance(quantifier: number, bindings: Enode[], maxGeneration: number) {
|
|
140
|
+
const generation = Math.max(maxGeneration, this.getGeneration(quantifier));
|
|
141
|
+
const roots = this.fingerprints.insert(quantifier, bindings);
|
|
142
|
+
if (roots !== null) this.qiQueue.insert(quantifier, roots, generation);
|
|
143
|
+
}
|
|
144
|
+
|
|
145
|
+
finalCheckEh(isFull: boolean) {
|
|
146
|
+
if (!isFull) return FC_DONE;
|
|
147
|
+
let result = this.qiQueue.finalCheckEh() ? FC_DONE : FC_CONTINUE;
|
|
148
|
+
if (this.quantifiers.length > 0 && this.lazyMatchingIndex < QI_MAX_LAZY_MULTIPATTERN_MATCHING) {
|
|
149
|
+
this.lazyMam.rematch();
|
|
150
|
+
const saved = this.lazyMatchingIndex;
|
|
151
|
+
this.context.pushTrail(() => {
|
|
152
|
+
this.lazyMatchingIndex = saved;
|
|
153
|
+
});
|
|
154
|
+
this.lazyMatchingIndex++;
|
|
155
|
+
}
|
|
156
|
+
if (this.context.canPropagate()) result = FC_CONTINUE;
|
|
157
|
+
return result;
|
|
158
|
+
}
|
|
159
|
+
|
|
160
|
+
initSearchEh() {
|
|
161
|
+
this.lazyMatchingIndex = 0;
|
|
162
|
+
this.mbqi?.checker.initSearchEh();
|
|
163
|
+
this.qiQueue.initSearchEh();
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
restartEh() {
|
|
167
|
+
this.mbqi?.finder.restartEh();
|
|
168
|
+
this.mbqi?.checker.restartEh();
|
|
169
|
+
}
|
|
170
|
+
|
|
171
|
+
isModelBased() {
|
|
172
|
+
return this.mbqi !== null;
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
adjustModel(model: ProtoModel) {
|
|
176
|
+
this.mbqi?.finder.fixModel(model);
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
checkModel(model: ProtoModel, root2value: Map<Enode, number>) {
|
|
180
|
+
const checker = this.mbqi?.checker;
|
|
181
|
+
if (this.quantifiers.length === 0) return CHECK_MODEL_SAT;
|
|
182
|
+
if (checker === undefined) return CHECK_MODEL_UNKNOWN;
|
|
183
|
+
if (checker.check(model, root2value)) return CHECK_MODEL_SAT;
|
|
184
|
+
return checker.hasNewInstances() ? CHECK_MODEL_RESTART : CHECK_MODEL_UNKNOWN;
|
|
185
|
+
}
|
|
186
|
+
}
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
// Ported from Z3 (src/util/util.h), MIT license, see z3-license.txt. random_gen: Z3's linear
|
|
2
|
+
// congruential generator, which the model finder and the simplex settings seed.
|
|
3
|
+
export class RandomGen {
|
|
4
|
+
constructor(private seed: number) {}
|
|
5
|
+
|
|
6
|
+
next() {
|
|
7
|
+
this.seed = (Math.imul(this.seed, 214013) + 2531011) >>> 0;
|
|
8
|
+
return (this.seed >>> 16) & 0x7fff;
|
|
9
|
+
}
|
|
10
|
+
}
|
|
@@ -0,0 +1,165 @@
|
|
|
1
|
+
// Ported from Z3 (src/util/rational.h), MIT license, see z3-license.txt. Exact rationals for the
|
|
2
|
+
// simplex tableau, normalized with a positive denominator.
|
|
3
|
+
|
|
4
|
+
export const getGcd = (first: bigint, second: bigint) => {
|
|
5
|
+
let left = first < 0n ? -first : first;
|
|
6
|
+
let right = second < 0n ? -second : second;
|
|
7
|
+
while (right !== 0n) {
|
|
8
|
+
const remainder = left % right;
|
|
9
|
+
left = right;
|
|
10
|
+
right = remainder;
|
|
11
|
+
}
|
|
12
|
+
return left;
|
|
13
|
+
};
|
|
14
|
+
|
|
15
|
+
const isBigInt = (value: bigint) => value <= -2147483648n || value > 2147483647n;
|
|
16
|
+
|
|
17
|
+
export const getLcm = (first: bigint, second: bigint) => {
|
|
18
|
+
const product = first * second;
|
|
19
|
+
return (product < 0n ? -product : product) / getGcd(first, second);
|
|
20
|
+
};
|
|
21
|
+
|
|
22
|
+
// mpz_manager's div and mod: SMT-LIB's, whose remainder is never negative. By a positive divisor,
|
|
23
|
+
// div is the floor of the quotient.
|
|
24
|
+
export const getEuclideanDiv = (dividend: bigint, divisor: bigint) => {
|
|
25
|
+
const quotient = dividend / divisor;
|
|
26
|
+
if (dividend >= 0n || quotient * divisor === dividend) return quotient;
|
|
27
|
+
return divisor < 0n ? quotient + 1n : quotient - 1n;
|
|
28
|
+
};
|
|
29
|
+
|
|
30
|
+
export const getEuclideanMod = (dividend: bigint, divisor: bigint) => {
|
|
31
|
+
const remainder = dividend % divisor;
|
|
32
|
+
if (remainder >= 0n) return remainder;
|
|
33
|
+
return divisor > 0n ? remainder + divisor : remainder - divisor;
|
|
34
|
+
};
|
|
35
|
+
|
|
36
|
+
// The n-th root of an integer when it is exact.
|
|
37
|
+
const getIntRoot = (value: bigint, degree: number): bigint | undefined => {
|
|
38
|
+
if (value < 0n) {
|
|
39
|
+
if (degree % 2 === 0) return undefined;
|
|
40
|
+
const root = getIntRoot(-value, degree);
|
|
41
|
+
return root === undefined ? undefined : -root;
|
|
42
|
+
}
|
|
43
|
+
if (value < 2n || degree === 1) return value;
|
|
44
|
+
const exponent = BigInt(degree);
|
|
45
|
+
let low = 0n;
|
|
46
|
+
let high = 1n;
|
|
47
|
+
while (high ** exponent <= value) high *= 2n;
|
|
48
|
+
while (high - low > 1n) {
|
|
49
|
+
const mid = (low + high) / 2n;
|
|
50
|
+
if (mid ** exponent <= value) low = mid;
|
|
51
|
+
else high = mid;
|
|
52
|
+
}
|
|
53
|
+
return low ** exponent === value ? low : undefined;
|
|
54
|
+
};
|
|
55
|
+
|
|
56
|
+
export class Rational {
|
|
57
|
+
static readonly zero = new Rational(0n, 1n);
|
|
58
|
+
static readonly one = new Rational(1n, 1n);
|
|
59
|
+
static readonly minusOne = new Rational(-1n, 1n);
|
|
60
|
+
|
|
61
|
+
private constructor(
|
|
62
|
+
readonly num: bigint,
|
|
63
|
+
readonly den: bigint,
|
|
64
|
+
) {}
|
|
65
|
+
|
|
66
|
+
static of(num: bigint, den = 1n) {
|
|
67
|
+
if (den === 1n) return new Rational(num, 1n);
|
|
68
|
+
const sign = den < 0n ? -1n : 1n;
|
|
69
|
+
const divisor = getGcd(num, den);
|
|
70
|
+
return new Rational((sign * num) / divisor, (sign * den) / divisor);
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
static fromNumber(value: number) {
|
|
74
|
+
return new Rational(BigInt(value), 1n);
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
isZero() {
|
|
78
|
+
return this.num === 0n;
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
isInt() {
|
|
82
|
+
return this.den === 1n;
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
isPositive() {
|
|
86
|
+
return this.num > 0n;
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
isNegative() {
|
|
90
|
+
return this.num < 0n;
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
// A sum with zero is the other operand, so a sum that starts at zero allocates nothing.
|
|
94
|
+
add(other: Rational) {
|
|
95
|
+
if (this.num === 0n) return other;
|
|
96
|
+
if (other.num === 0n) return this;
|
|
97
|
+
if (this.den === 1n && other.den === 1n) return new Rational(this.num + other.num, 1n);
|
|
98
|
+
return Rational.of(this.num * other.den + other.num * this.den, this.den * other.den);
|
|
99
|
+
}
|
|
100
|
+
|
|
101
|
+
sub(other: Rational) {
|
|
102
|
+
if (other.num === 0n) return this;
|
|
103
|
+
if (this.den === 1n && other.den === 1n) return new Rational(this.num - other.num, 1n);
|
|
104
|
+
return Rational.of(this.num * other.den - other.num * this.den, this.den * other.den);
|
|
105
|
+
}
|
|
106
|
+
|
|
107
|
+
mul(other: Rational) {
|
|
108
|
+
if (this.den === 1n && other.den === 1n) return new Rational(this.num * other.num, 1n);
|
|
109
|
+
return Rational.of(this.num * other.num, this.den * other.den);
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
div(other: Rational) {
|
|
113
|
+
return Rational.of(this.num * other.den, this.den * other.num);
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
neg() {
|
|
117
|
+
return new Rational(-this.num, this.den);
|
|
118
|
+
}
|
|
119
|
+
|
|
120
|
+
abs() {
|
|
121
|
+
return this.num < 0n ? this.neg() : this;
|
|
122
|
+
}
|
|
123
|
+
|
|
124
|
+
// root: the n-th root when it is rational.
|
|
125
|
+
root(degree: number) {
|
|
126
|
+
const num = getIntRoot(this.num, degree);
|
|
127
|
+
const den = num === undefined ? undefined : getIntRoot(this.den, degree);
|
|
128
|
+
return num === undefined || den === undefined ? undefined : Rational.of(num, den);
|
|
129
|
+
}
|
|
130
|
+
|
|
131
|
+
pow(exponent: number) {
|
|
132
|
+
return Rational.of(this.num ** BigInt(exponent), this.den ** BigInt(exponent));
|
|
133
|
+
}
|
|
134
|
+
|
|
135
|
+
// is_big: mpz keeps a numerator or denominator outside a 32-bit int as a bignum.
|
|
136
|
+
isBig() {
|
|
137
|
+
return isBigInt(this.num) || isBigInt(this.den);
|
|
138
|
+
}
|
|
139
|
+
|
|
140
|
+
compare(other: Rational) {
|
|
141
|
+
const left = this.num * other.den;
|
|
142
|
+
const right = other.num * this.den;
|
|
143
|
+
return left < right ? -1 : left > right ? 1 : 0;
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
equals(other: Rational) {
|
|
147
|
+
return this.num === other.num && this.den === other.den;
|
|
148
|
+
}
|
|
149
|
+
|
|
150
|
+
floor() {
|
|
151
|
+
if (this.den === 1n) return this;
|
|
152
|
+
const quotient = this.num / this.den;
|
|
153
|
+
return new Rational(this.num < 0n ? quotient - 1n : quotient, 1n);
|
|
154
|
+
}
|
|
155
|
+
|
|
156
|
+
ceil() {
|
|
157
|
+
if (this.den === 1n) return this;
|
|
158
|
+
const quotient = this.num / this.den;
|
|
159
|
+
return new Rational(this.num < 0n ? quotient : quotient + 1n, 1n);
|
|
160
|
+
}
|
|
161
|
+
|
|
162
|
+
toString() {
|
|
163
|
+
return this.den === 1n ? `${this.num}` : `${this.num}/${this.den}`;
|
|
164
|
+
}
|
|
165
|
+
}
|
|
@@ -0,0 +1,62 @@
|
|
|
1
|
+
// Ported from Z3 (src/util/ref_vector.h), MIT license, see z3-license.txt. expr_ref_vector: a vector
|
|
2
|
+
// that holds a reference to each expression in it, with -1 for Z3's null pointer.
|
|
3
|
+
import type { AstManager } from "./ast";
|
|
4
|
+
|
|
5
|
+
export class RefVector {
|
|
6
|
+
items: number[] = [];
|
|
7
|
+
|
|
8
|
+
constructor(private manager: AstManager) {}
|
|
9
|
+
|
|
10
|
+
get size() {
|
|
11
|
+
return this.items.length;
|
|
12
|
+
}
|
|
13
|
+
|
|
14
|
+
private incRef(expr: number) {
|
|
15
|
+
if (expr !== -1) this.manager.incRef(expr);
|
|
16
|
+
}
|
|
17
|
+
|
|
18
|
+
private decRef(expr: number) {
|
|
19
|
+
if (expr !== -1) this.manager.decRef(expr);
|
|
20
|
+
}
|
|
21
|
+
|
|
22
|
+
push(expr: number) {
|
|
23
|
+
this.incRef(expr);
|
|
24
|
+
this.items.push(expr);
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
// push_back(expr_ref&&): takes over a reference the caller owns.
|
|
28
|
+
pushOwned(expr: number) {
|
|
29
|
+
this.items.push(expr);
|
|
30
|
+
}
|
|
31
|
+
|
|
32
|
+
set(index: number, expr: number) {
|
|
33
|
+
this.incRef(expr);
|
|
34
|
+
this.decRef(this.items[index]);
|
|
35
|
+
this.items[index] = expr;
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
// operator=(expr_ref&&): takes over a reference the caller owns.
|
|
39
|
+
setOwned(index: number, expr: number) {
|
|
40
|
+
this.decRef(this.items[index]);
|
|
41
|
+
this.items[index] = expr;
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
pop() {
|
|
45
|
+
this.decRef(this.items.pop() as number);
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
// shrink: releases the removed expressions in order.
|
|
49
|
+
shrink(size: number) {
|
|
50
|
+
for (const expr of this.items.splice(size)) this.decRef(expr);
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
// resize: a larger vector is filled with null pointers.
|
|
54
|
+
resize(size: number) {
|
|
55
|
+
if (size < this.items.length) this.shrink(size);
|
|
56
|
+
while (this.items.length < size) this.items.push(-1);
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
reset() {
|
|
60
|
+
this.shrink(0);
|
|
61
|
+
}
|
|
62
|
+
}
|
|
@@ -0,0 +1,247 @@
|
|
|
1
|
+
// Ported from Z3 (src/smt/smt_relevancy.h, src/smt/smt_relevancy.cpp), MIT license, see
|
|
2
|
+
// z3-license.txt. Relevancy level 2: only subterms that the current assignment needs are relevant,
|
|
3
|
+
// and E-matching and the theories only look at relevant terms.
|
|
4
|
+
import { AstManager, KIND_APP, OP_AND, OP_IMPLIES, OP_ITE, OP_OR } from "./ast";
|
|
5
|
+
import type { Enode } from "./enode";
|
|
6
|
+
import { shrink } from "./array";
|
|
7
|
+
|
|
8
|
+
type RelevancyHandler = () => void;
|
|
9
|
+
|
|
10
|
+
interface RelevancyContext {
|
|
11
|
+
manager: AstManager;
|
|
12
|
+
// lbool as 1, -1 or 0.
|
|
13
|
+
findAssignment(expr: number): number;
|
|
14
|
+
findEnode(expr: number): Enode | undefined;
|
|
15
|
+
relevantEh(expr: number): void;
|
|
16
|
+
}
|
|
17
|
+
|
|
18
|
+
const TRAIL_POS_WATCH = 0;
|
|
19
|
+
const TRAIL_NEG_WATCH = 1;
|
|
20
|
+
const TRAIL_HANDLER = 2;
|
|
21
|
+
|
|
22
|
+
export class RelevancyPropagator {
|
|
23
|
+
private qhead = 0;
|
|
24
|
+
// m_relevant_exprs: the relevant expressions in the order they were marked, which it holds.
|
|
25
|
+
private relevantExprs: number[] = [];
|
|
26
|
+
// A flag per expression, which grows with the expressions marked.
|
|
27
|
+
private isRelevantFlags = new Uint8Array(1024);
|
|
28
|
+
// The watches and handlers of each expression, by trail kind, are lists of cons cells like Z3's
|
|
29
|
+
// relevancy_ehs. A trail entry is the cell it pushed: its handler and the list it extends. heads
|
|
30
|
+
// holds, at 3 * expr + kind, one past the trail index of the list's first cell, or 0.
|
|
31
|
+
private heads = new Int32Array(3072);
|
|
32
|
+
private trailKinds: number[] = [];
|
|
33
|
+
private trailExprs: number[] = [];
|
|
34
|
+
private trailHandlers: RelevancyHandler[] = [];
|
|
35
|
+
private trailNext: number[] = [];
|
|
36
|
+
private scopes: number[] = [];
|
|
37
|
+
private isPropagating = false;
|
|
38
|
+
|
|
39
|
+
// At relevancy level 0 every expression is relevant and nothing propagates.
|
|
40
|
+
constructor(
|
|
41
|
+
private context: RelevancyContext,
|
|
42
|
+
readonly isEnabled: boolean,
|
|
43
|
+
) {}
|
|
44
|
+
|
|
45
|
+
isRelevant(expr: number) {
|
|
46
|
+
return !this.isEnabled || this.isRelevantFlags[expr] === 1;
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
addHandler(source: number, handler: RelevancyHandler) {
|
|
50
|
+
if (!this.isEnabled) return;
|
|
51
|
+
if (this.isRelevant(source)) {
|
|
52
|
+
handler();
|
|
53
|
+
return;
|
|
54
|
+
}
|
|
55
|
+
this.pushTrail(TRAIL_HANDLER, source, handler);
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
addDependency(source: number, target: number) {
|
|
59
|
+
if (this.isRelevant(source)) this.markAsRelevant(target);
|
|
60
|
+
else this.addHandler(source, () => this.markAsRelevant(target));
|
|
61
|
+
}
|
|
62
|
+
|
|
63
|
+
addWatch(expr: number, value: boolean, handler: RelevancyHandler) {
|
|
64
|
+
if (!this.isEnabled) return;
|
|
65
|
+
const assignment = this.context.findAssignment(expr) * (value ? 1 : -1);
|
|
66
|
+
if (assignment < 0) return;
|
|
67
|
+
if (assignment > 0) {
|
|
68
|
+
handler();
|
|
69
|
+
return;
|
|
70
|
+
}
|
|
71
|
+
this.pushTrail(value ? TRAIL_POS_WATCH : TRAIL_NEG_WATCH, expr, handler);
|
|
72
|
+
}
|
|
73
|
+
|
|
74
|
+
// push_trail: the trail holds its expressions. The cell goes in front of the expression's list.
|
|
75
|
+
private pushTrail(kind: number, expr: number, handler: RelevancyHandler) {
|
|
76
|
+
this.context.manager.incRef(expr);
|
|
77
|
+
const head = 3 * expr + kind;
|
|
78
|
+
if (head >= this.heads.length) {
|
|
79
|
+
const grown = new Int32Array(Math.max(2 * this.heads.length, 3 * expr + 3));
|
|
80
|
+
grown.set(this.heads);
|
|
81
|
+
this.heads = grown;
|
|
82
|
+
}
|
|
83
|
+
this.trailNext.push(this.heads[head]);
|
|
84
|
+
this.trailHandlers.push(handler);
|
|
85
|
+
this.trailKinds.push(kind);
|
|
86
|
+
this.trailExprs.push(expr);
|
|
87
|
+
this.heads[head] = this.trailKinds.length;
|
|
88
|
+
}
|
|
89
|
+
|
|
90
|
+
// Runs the list of a kind and expression from its first cell, so the latest handler runs first.
|
|
91
|
+
// Handlers that a run adds go in front of the cell it started from, so the run skips them.
|
|
92
|
+
private runList(kind: number, expr: number) {
|
|
93
|
+
const head = 3 * expr + kind;
|
|
94
|
+
if (head >= this.heads.length) return;
|
|
95
|
+
for (let cell = this.heads[head]; cell !== 0; cell = this.trailNext[cell - 1])
|
|
96
|
+
this.trailHandlers[cell - 1]();
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
push() {
|
|
100
|
+
this.scopes.push(this.relevantExprs.length, this.trailKinds.length);
|
|
101
|
+
}
|
|
102
|
+
|
|
103
|
+
pop(numScopes: number) {
|
|
104
|
+
const offset = this.scopes.length - numScopes * 2;
|
|
105
|
+
const relevantLimit = this.scopes[offset];
|
|
106
|
+
const trailLimit = this.scopes[offset + 1];
|
|
107
|
+
const manager = this.context.manager;
|
|
108
|
+
for (let index = this.relevantExprs.length - 1; index >= relevantLimit; index--)
|
|
109
|
+
this.isRelevantFlags[this.relevantExprs[index]] = 0;
|
|
110
|
+
for (let index = relevantLimit; index < this.relevantExprs.length; index++)
|
|
111
|
+
manager.decRef(this.relevantExprs[index]);
|
|
112
|
+
shrink(this.relevantExprs, relevantLimit);
|
|
113
|
+
this.qhead = relevantLimit;
|
|
114
|
+
for (let index = this.trailKinds.length - 1; index >= trailLimit; index--) {
|
|
115
|
+
const expr = this.trailExprs[index];
|
|
116
|
+
this.heads[3 * expr + this.trailKinds[index]] = this.trailNext[index];
|
|
117
|
+
manager.decRef(expr);
|
|
118
|
+
}
|
|
119
|
+
shrink(this.trailKinds, trailLimit);
|
|
120
|
+
shrink(this.trailExprs, trailLimit);
|
|
121
|
+
shrink(this.trailHandlers, trailLimit);
|
|
122
|
+
shrink(this.trailNext, trailLimit);
|
|
123
|
+
shrink(this.scopes, offset);
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
private setRelevant(expr: number) {
|
|
127
|
+
if (expr >= this.isRelevantFlags.length) {
|
|
128
|
+
const flags = new Uint8Array(Math.max(2 * this.isRelevantFlags.length, expr + 1));
|
|
129
|
+
flags.set(this.isRelevantFlags);
|
|
130
|
+
this.isRelevantFlags = flags;
|
|
131
|
+
}
|
|
132
|
+
this.isRelevantFlags[expr] = 1;
|
|
133
|
+
this.context.manager.incRef(expr);
|
|
134
|
+
this.relevantExprs.push(expr);
|
|
135
|
+
this.context.relevantEh(expr);
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
// Marks expr and every member of its equivalence class as relevant.
|
|
139
|
+
markAsRelevant(expr: number) {
|
|
140
|
+
if (this.isRelevant(expr)) return;
|
|
141
|
+
const node = this.context.findEnode(expr);
|
|
142
|
+
if (node === undefined) {
|
|
143
|
+
this.setRelevant(expr);
|
|
144
|
+
return;
|
|
145
|
+
}
|
|
146
|
+
let current = node;
|
|
147
|
+
do {
|
|
148
|
+
if (!this.isRelevant(current.owner)) this.setRelevant(current.owner);
|
|
149
|
+
current = current.next;
|
|
150
|
+
} while (current !== node);
|
|
151
|
+
}
|
|
152
|
+
|
|
153
|
+
private propagateApp(expr: number) {
|
|
154
|
+
for (let index = this.context.manager.getNumArgs(expr) - 1; index >= 0; index--)
|
|
155
|
+
this.markAsRelevant(this.context.manager.getArg(expr, index));
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
propagateImplies(expr: number) {
|
|
159
|
+
const context = this.context;
|
|
160
|
+
const value = context.findAssignment(expr);
|
|
161
|
+
if (value < 0) {
|
|
162
|
+
this.propagateApp(expr);
|
|
163
|
+
return;
|
|
164
|
+
}
|
|
165
|
+
if (context.findAssignment(context.manager.getArg(expr, 0)) < 0) {
|
|
166
|
+
this.markAsRelevant(context.manager.getArg(expr, 0));
|
|
167
|
+
return;
|
|
168
|
+
}
|
|
169
|
+
if (context.findAssignment(context.manager.getArg(expr, 1)) > 0)
|
|
170
|
+
this.markAsRelevant(context.manager.getArg(expr, 1));
|
|
171
|
+
}
|
|
172
|
+
|
|
173
|
+
propagateOr(expr: number) {
|
|
174
|
+
const context = this.context;
|
|
175
|
+
if (context.findAssignment(expr) < 0) {
|
|
176
|
+
this.propagateApp(expr);
|
|
177
|
+
return;
|
|
178
|
+
}
|
|
179
|
+
let trueArg = -1;
|
|
180
|
+
for (let index = 0; index < context.manager.getNumArgs(expr); index++) {
|
|
181
|
+
const arg = context.manager.getArg(expr, index);
|
|
182
|
+
if (context.findAssignment(arg) <= 0) continue;
|
|
183
|
+
if (this.isRelevant(arg)) return;
|
|
184
|
+
if (trueArg === -1) trueArg = arg;
|
|
185
|
+
}
|
|
186
|
+
if (trueArg !== -1) this.markAsRelevant(trueArg);
|
|
187
|
+
}
|
|
188
|
+
|
|
189
|
+
propagateAnd(expr: number) {
|
|
190
|
+
const context = this.context;
|
|
191
|
+
const value = context.findAssignment(expr);
|
|
192
|
+
if (value > 0) {
|
|
193
|
+
this.propagateApp(expr);
|
|
194
|
+
return;
|
|
195
|
+
}
|
|
196
|
+
if (value === 0) return;
|
|
197
|
+
let falseArg = -1;
|
|
198
|
+
for (let index = 0; index < context.manager.getNumArgs(expr); index++) {
|
|
199
|
+
const arg = context.manager.getArg(expr, index);
|
|
200
|
+
if (context.findAssignment(arg) >= 0) continue;
|
|
201
|
+
if (this.isRelevant(arg)) return;
|
|
202
|
+
if (falseArg === -1) falseArg = arg;
|
|
203
|
+
}
|
|
204
|
+
if (falseArg !== -1) this.markAsRelevant(falseArg);
|
|
205
|
+
}
|
|
206
|
+
|
|
207
|
+
propagateIte(expr: number) {
|
|
208
|
+
this.markAsRelevant(this.context.manager.getArg(expr, 0));
|
|
209
|
+
const value = this.context.findAssignment(this.context.manager.getArg(expr, 0));
|
|
210
|
+
if (value < 0) this.markAsRelevant(this.context.manager.getArg(expr, 2));
|
|
211
|
+
else if (value > 0) this.markAsRelevant(this.context.manager.getArg(expr, 1));
|
|
212
|
+
}
|
|
213
|
+
|
|
214
|
+
canPropagate() {
|
|
215
|
+
return this.qhead < this.relevantExprs.length;
|
|
216
|
+
}
|
|
217
|
+
|
|
218
|
+
propagate() {
|
|
219
|
+
if (this.isPropagating) return;
|
|
220
|
+
this.isPropagating = true;
|
|
221
|
+
const manager = this.context.manager;
|
|
222
|
+
while (this.qhead < this.relevantExprs.length) {
|
|
223
|
+
const expr = this.relevantExprs[this.qhead];
|
|
224
|
+
this.qhead++;
|
|
225
|
+
if (manager.kinds[expr] === KIND_APP) {
|
|
226
|
+
const op = manager.getOp(expr);
|
|
227
|
+
if (op === OP_OR) this.propagateOr(expr);
|
|
228
|
+
else if (op === OP_AND) this.propagateAnd(expr);
|
|
229
|
+
else if (op === OP_IMPLIES) this.propagateImplies(expr);
|
|
230
|
+
else if (op === OP_ITE) this.propagateIte(expr);
|
|
231
|
+
else this.propagateApp(expr);
|
|
232
|
+
}
|
|
233
|
+
this.runList(TRAIL_HANDLER, expr);
|
|
234
|
+
}
|
|
235
|
+
this.isPropagating = false;
|
|
236
|
+
}
|
|
237
|
+
|
|
238
|
+
assignEh(expr: number, value: boolean) {
|
|
239
|
+
if (this.isRelevant(expr)) {
|
|
240
|
+
const op = this.context.manager.getOp(expr);
|
|
241
|
+
if (op === OP_OR) this.propagateOr(expr);
|
|
242
|
+
else if (op === OP_AND) this.propagateAnd(expr);
|
|
243
|
+
else if (op === OP_IMPLIES) this.propagateImplies(expr);
|
|
244
|
+
}
|
|
245
|
+
this.runList(value ? TRAIL_POS_WATCH : TRAIL_NEG_WATCH, expr);
|
|
246
|
+
}
|
|
247
|
+
}
|