tla-ts 0.0.4-dev.4819fb7 → 0.0.4-dev.55f2117
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 +37 -126
- 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 +33 -1
- package/dist/index.d.ts +33 -1
- 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 +996 -0
- package/dist/prove.js +996 -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 +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/ast.ts +2 -2
- package/src/check.ts +8 -7
- package/src/{cli-options.ts → cli/options.ts} +1 -1
- package/src/{run-cli.ts → cli/run.ts} +302 -100
- package/src/cli.ts +1 -1
- package/src/codegen.ts +26 -7
- package/src/config.ts +2 -2
- package/src/environment.ts +9 -9
- package/src/errors.ts +89 -30
- package/src/evaluate.ts +58 -23
- package/src/index.ts +10 -0
- package/src/levels.ts +1 -1
- package/src/live-check.ts +1 -1
- package/src/liveness.ts +1 -1
- package/src/{obligation-action.ts → obligations/action.ts} +247 -69
- package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
- package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
- package/src/{obligations.ts → obligations/index.ts} +32 -16
- package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
- package/src/{obligation-module.ts → obligations/module.ts} +113 -121
- package/src/obligations/pickle.ts +98 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/{obligation-source.ts → obligations/source.ts} +154 -99
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +4 -20
- package/src/parallel.ts +13 -46
- package/src/parser.ts +1 -1
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -2
- package/src/{pcal-parse.ts → pcal/parse.ts} +3 -3
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +2 -2
- package/src/{pcal-translate.ts → pcal/translate.ts} +2 -2
- package/src/{pcal-validate.ts → pcal/validate.ts} +6 -6
- package/src/prove/decide-pool.ts +95 -0
- package/src/prove/deciders.ts +33 -0
- package/src/prove/first-order.ts +78 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +446 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +546 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +433 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +331 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +330 -0
- package/src/prove/isabelle/pure/name.ts +98 -0
- package/src/prove/isabelle/pure/net.ts +215 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +631 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +133 -0
- package/src/prove/isabelle/pure/simplifier.ts +106 -0
- package/src/prove/isabelle/pure/table.ts +201 -0
- package/src/prove/isabelle/pure/tactic.ts +168 -0
- package/src/prove/isabelle/pure/tactical.ts +264 -0
- package/src/prove/isabelle/pure/term-ord.ts +105 -0
- package/src/prove/isabelle/pure/term.ts +688 -0
- package/src/prove/isabelle/pure/thm.ts +783 -0
- package/src/prove/isabelle/pure/type.ts +121 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +508 -0
- package/src/prove/prep/defs.ts +33 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +529 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +22 -0
- package/src/prove/prove.ts +498 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +255 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +209 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +636 -0
- package/src/prove/smt/encode.ts +164 -0
- package/src/prove/smt/extensionality.ts +65 -0
- package/src/prove/smt/flatten.ts +112 -0
- package/src/prove/smt/format.ts +154 -0
- package/src/prove/smt/instances.ts +181 -0
- package/src/prove/smt/rewrite.ts +772 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +91 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/cache.ts +236 -0
- package/src/prove/tlapm/ocaml-marshal.ts +166 -0
- package/src/prove/tlapm/tlapm.ts +96 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +18 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +379 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +162 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +1 -1
- package/src/resolve.ts +1 -1
- package/src/runtime.ts +2 -2
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +14 -14
- package/src/{sany-levels.ts → sany/levels.ts} +2 -2
- package/src/{sany-lexer.ts → sany/lexer.ts} +1 -1
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +15 -15
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -3
- package/src/{sany-source.ts → sany/source.ts} +6 -6
- package/src/{sany-xml.ts → sany/xml.ts} +5 -5
- package/src/spec-description.ts +1 -1
- package/src/{standard-levels.ts → standard/levels.ts} +1 -1
- package/src/{standard-modules.ts → standard/modules.ts} +17 -14
- package/src/{standard-ranges.ts → standard/ranges.ts} +1 -1
- package/src/state-graph.ts +1 -1
- package/src/successors.ts +25 -6
- package/src/symmetry.ts +1 -1
- package/src/{tlc-messages.ts → tlc/messages.ts} +2 -2
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +58 -35
- package/src/{tlc-replay.ts → tlc/replay.ts} +5 -5
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +14 -8
- package/src/{tlc-version.ts → tlc/version.ts} +8 -7
- package/src/values.ts +81 -36
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -55
- package/dist/run-cli.js +0 -55
- package/src/value-sources.ts +0 -29
- /package/src/{sany-nodes.ts → sany/nodes.ts} +0 -0
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
|
@@ -0,0 +1,562 @@
|
|
|
1
|
+
// Ported from Z3 (src/smt/smt_model_finder.cpp, src/ast/macros/quantifier_macro_info.cpp), MIT
|
|
2
|
+
// license, see z3-license.txt. The quantifier analyzer of the model finder, which collects how the
|
|
3
|
+
// variables of each quantifier occur, and the quantifier info where it records what it learns.
|
|
4
|
+
import {
|
|
5
|
+
KIND_APP,
|
|
6
|
+
KIND_VAR,
|
|
7
|
+
OP_ADD,
|
|
8
|
+
OP_AND,
|
|
9
|
+
OP_EQ,
|
|
10
|
+
OP_GE,
|
|
11
|
+
OP_IMPLIES,
|
|
12
|
+
OP_ITE,
|
|
13
|
+
OP_LE,
|
|
14
|
+
OP_NOT,
|
|
15
|
+
OP_OR,
|
|
16
|
+
OP_XOR,
|
|
17
|
+
FAMILY_BASIC,
|
|
18
|
+
FAMILY_USER,
|
|
19
|
+
type AstManager,
|
|
20
|
+
} from "./ast";
|
|
21
|
+
import type { Context } from "./context";
|
|
22
|
+
import { collectMacroCandidates, releaseCondMacros } from "./model-macro-solver";
|
|
23
|
+
import { pullQuant } from "./pull-quant";
|
|
24
|
+
import { Rational } from "./rational";
|
|
25
|
+
import { Rewriter } from "./rewriter";
|
|
26
|
+
import { AufSolver, type Evaluate, InstantiationSet, Node } from "./auf-solver";
|
|
27
|
+
|
|
28
|
+
// smt_params' mbqi_force_template: macros of quantifiers with at least this weight are used even
|
|
29
|
+
// in the AUF fragment.
|
|
30
|
+
export const MBQI_FORCE_TEMPLATE = 10;
|
|
31
|
+
|
|
32
|
+
// qinfo: a bit of information about how a variable occurs in a quantifier.
|
|
33
|
+
type QInfo =
|
|
34
|
+
| { kind: "f_var"; decl: number; argIndex: number; varIndex: number }
|
|
35
|
+
| { kind: "f_var_plus_offset"; decl: number; argIndex: number; varIndex: number; offset: number }
|
|
36
|
+
| { kind: "x_eq_y" | "x_neq_y" | "x_leq_y"; first: number; second: number }
|
|
37
|
+
| { kind: "x_eq_t" | "x_neq_t" | "x_gle_t"; varIndex: number; term: number };
|
|
38
|
+
|
|
39
|
+
const isSameQInfo = (first: QInfo, second: QInfo) =>
|
|
40
|
+
JSON.stringify(first) === JSON.stringify(second);
|
|
41
|
+
|
|
42
|
+
const mkVarPair = (kind: "x_eq_y" | "x_neq_y" | "x_leq_y", first: number, second: number): QInfo =>
|
|
43
|
+
first > second ? { kind, first: second, second: first } : { kind, first, second };
|
|
44
|
+
|
|
45
|
+
// quantifier_info: what the analyzer learned about one quantifier.
|
|
46
|
+
export class QuantifierInfo {
|
|
47
|
+
readonly flatQ: number;
|
|
48
|
+
qinfos: QInfo[] = [];
|
|
49
|
+
isAuf = true;
|
|
50
|
+
hasXEqY = false;
|
|
51
|
+
readonly ngDecls = new Set<number>();
|
|
52
|
+
theOne: number | null = null;
|
|
53
|
+
private uvarInstSets: (InstantiationSet | null)[] | null = null;
|
|
54
|
+
readonly condMacros;
|
|
55
|
+
|
|
56
|
+
constructor(
|
|
57
|
+
private manager: AstManager,
|
|
58
|
+
private context: Context,
|
|
59
|
+
readonly quantifier: number,
|
|
60
|
+
macroRewriter: Rewriter,
|
|
61
|
+
) {
|
|
62
|
+
// m_flat_q, which holds a reference.
|
|
63
|
+
const isNested = manager.hasQuantifierFlags[manager.getQuantifier(quantifier).body];
|
|
64
|
+
this.flatQ = isNested ? pullQuant(manager, quantifier) : quantifier;
|
|
65
|
+
if (!isNested) manager.incRef(quantifier);
|
|
66
|
+
this.condMacros = collectMacroCandidates(manager, macroRewriter, this.flatQ);
|
|
67
|
+
}
|
|
68
|
+
|
|
69
|
+
// ~quantifier_info: the conditional macros go before the flat quantifier.
|
|
70
|
+
release() {
|
|
71
|
+
releaseCondMacros(this.manager, this.condMacros);
|
|
72
|
+
this.manager.decRef(this.flatQ);
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
insertQInfo(info: QInfo) {
|
|
76
|
+
if (!this.qinfos.some((other) => isSameQInfo(other, info))) this.qinfos.push(info);
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
processAuf(solver: AufSolver) {
|
|
80
|
+
const flatQ = this.flatQ;
|
|
81
|
+
const numDecls = this.manager.getQuantifier(flatQ).sorts.length;
|
|
82
|
+
for (let index = 0; index < numDecls; index++) solver.getUvar(flatQ, index);
|
|
83
|
+
for (const info of this.qinfos) {
|
|
84
|
+
switch (info.kind) {
|
|
85
|
+
case "f_var":
|
|
86
|
+
solver.getAFI(info.decl, info.argIndex).merge(solver.getUvar(flatQ, info.varIndex));
|
|
87
|
+
break;
|
|
88
|
+
case "f_var_plus_offset":
|
|
89
|
+
solver.getAFI(info.decl, info.argIndex);
|
|
90
|
+
solver.getUvar(flatQ, info.varIndex);
|
|
91
|
+
break;
|
|
92
|
+
case "x_eq_y": {
|
|
93
|
+
const first = solver.getUvar(flatQ, info.first);
|
|
94
|
+
const second = solver.getUvar(flatQ, info.second);
|
|
95
|
+
first.insertAvoid(second);
|
|
96
|
+
if (first !== second) second.insertAvoid(first);
|
|
97
|
+
break;
|
|
98
|
+
}
|
|
99
|
+
case "x_neq_y":
|
|
100
|
+
solver.getUvar(flatQ, info.first).merge(solver.getUvar(flatQ, info.second));
|
|
101
|
+
break;
|
|
102
|
+
case "x_leq_y": {
|
|
103
|
+
const first = solver.getUvar(flatQ, info.first);
|
|
104
|
+
first.merge(solver.getUvar(flatQ, info.second));
|
|
105
|
+
first.setMonoProj();
|
|
106
|
+
break;
|
|
107
|
+
}
|
|
108
|
+
case "x_eq_t":
|
|
109
|
+
solver.getUvar(flatQ, info.varIndex).insertException(info.term);
|
|
110
|
+
break;
|
|
111
|
+
case "x_neq_t":
|
|
112
|
+
solver.getUvar(flatQ, info.varIndex);
|
|
113
|
+
break;
|
|
114
|
+
case "x_gle_t":
|
|
115
|
+
solver.getUvar(flatQ, info.varIndex).setMonoProj();
|
|
116
|
+
break;
|
|
117
|
+
}
|
|
118
|
+
}
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
private populateFVar(node: Node, decl: number, argIndex: number) {
|
|
122
|
+
const context = this.context;
|
|
123
|
+
for (const enode of context.enodesOf(decl))
|
|
124
|
+
if (context.isRelevant(enode.owner)) {
|
|
125
|
+
const arg = enode.getArg(argIndex);
|
|
126
|
+
node.insert(this.manager, arg.owner, context.getGeneration(arg));
|
|
127
|
+
}
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
populateInstSets(solver: AufSolver) {
|
|
131
|
+
const manager = this.manager;
|
|
132
|
+
const context = this.context;
|
|
133
|
+
const flatQ = this.flatQ;
|
|
134
|
+
const sorts = manager.getQuantifier(flatQ).sorts;
|
|
135
|
+
for (const info of this.qinfos) {
|
|
136
|
+
switch (info.kind) {
|
|
137
|
+
case "f_var":
|
|
138
|
+
this.populateFVar(solver.getAFI(info.decl, info.argIndex), info.decl, info.argIndex);
|
|
139
|
+
break;
|
|
140
|
+
case "f_var_plus_offset": {
|
|
141
|
+
const aFI = solver.getAFI(info.decl, info.argIndex).getRoot();
|
|
142
|
+
const sJ = solver.getUvar(flatQ, info.varIndex).getRoot();
|
|
143
|
+
if (aFI === sJ) {
|
|
144
|
+
// There is no finite fixpoint, so the arguments minus the offset join the set.
|
|
145
|
+
for (const enode of context.enodesOf(info.decl))
|
|
146
|
+
if (context.isRelevant(enode.owner)) {
|
|
147
|
+
const arg = enode.getArg(info.argIndex);
|
|
148
|
+
sJ.insert(
|
|
149
|
+
manager,
|
|
150
|
+
solver.rewriter.mkSub(arg.owner, info.offset),
|
|
151
|
+
context.getGeneration(arg),
|
|
152
|
+
);
|
|
153
|
+
}
|
|
154
|
+
} else {
|
|
155
|
+
this.populateFVar(aFI, info.decl, info.argIndex);
|
|
156
|
+
if (aFI.isMonoProj()) sJ.setMonoProj();
|
|
157
|
+
if (sJ.isMonoProj()) aFI.setMonoProj();
|
|
158
|
+
}
|
|
159
|
+
break;
|
|
160
|
+
}
|
|
161
|
+
case "x_eq_t": {
|
|
162
|
+
const sort = sorts[sorts.length - info.varIndex - 1];
|
|
163
|
+
if (manager.isUninterpretedSort(sort)) {
|
|
164
|
+
// Every term of the sort joins the set, see Section 4.1 of the paper.
|
|
165
|
+
const node = solver.getUvar(flatQ, info.varIndex);
|
|
166
|
+
for (const enode of context.enodes)
|
|
167
|
+
if (context.isRelevant(enode.owner) && manager.sorts[enode.owner] === sort)
|
|
168
|
+
node.insert(manager, enode.owner, context.getGeneration(enode));
|
|
169
|
+
}
|
|
170
|
+
break;
|
|
171
|
+
}
|
|
172
|
+
case "x_neq_t":
|
|
173
|
+
case "x_gle_t":
|
|
174
|
+
solver.getUvar(flatQ, info.varIndex).insert(manager, info.term, 0);
|
|
175
|
+
break;
|
|
176
|
+
default:
|
|
177
|
+
break;
|
|
178
|
+
}
|
|
179
|
+
}
|
|
180
|
+
// The second pass for the offsets: A_f_i - k is in S_j and S_j + k is in A_f_i.
|
|
181
|
+
for (const info of this.qinfos) {
|
|
182
|
+
if (info.kind !== "f_var_plus_offset") continue;
|
|
183
|
+
const aFI = solver.getAFI(info.decl, info.argIndex).getRoot();
|
|
184
|
+
const sJ = solver.getUvar(flatQ, info.varIndex).getRoot();
|
|
185
|
+
if (aFI === sJ) continue;
|
|
186
|
+
this.copyInstances(solver.rewriter, aFI, sJ, info.offset, false);
|
|
187
|
+
this.copyInstances(solver.rewriter, sJ, aFI, info.offset, true);
|
|
188
|
+
}
|
|
189
|
+
}
|
|
190
|
+
|
|
191
|
+
private copyInstances(rewriter: Rewriter, from: Node, to: Node, offset: number, isPlus: boolean) {
|
|
192
|
+
for (const entry of from.getInstantiationSet().elems)
|
|
193
|
+
to.insert(
|
|
194
|
+
this.manager,
|
|
195
|
+
isPlus ? rewriter.mkAdd([entry[0], offset]) : rewriter.mkSub(entry[0], offset),
|
|
196
|
+
entry[1],
|
|
197
|
+
);
|
|
198
|
+
}
|
|
199
|
+
|
|
200
|
+
// populate_macro_based_inst_sets: the sets of a quantifier that a macro satisfies.
|
|
201
|
+
getMacroBasedInstSet(varIndex: number, evaluate: Evaluate) {
|
|
202
|
+
const theOne = this.theOne;
|
|
203
|
+
if (theOne === null) return null;
|
|
204
|
+
if (this.uvarInstSets === null) {
|
|
205
|
+
const sets: (InstantiationSet | null)[] = [];
|
|
206
|
+
for (const info of this.qinfos) {
|
|
207
|
+
if (info.kind !== "f_var" || info.decl !== theOne) continue;
|
|
208
|
+
const set = sets[info.varIndex] ?? new InstantiationSet(this.manager);
|
|
209
|
+
sets[info.varIndex] = set;
|
|
210
|
+
for (const enode of this.context.enodesOf(info.decl))
|
|
211
|
+
if (this.context.isRelevant(enode.owner)) {
|
|
212
|
+
const arg = enode.getArg(info.argIndex);
|
|
213
|
+
set.insert(arg.owner, this.context.getGeneration(arg));
|
|
214
|
+
}
|
|
215
|
+
}
|
|
216
|
+
for (const set of sets) set?.mkInverse(evaluate);
|
|
217
|
+
this.uvarInstSets = sets;
|
|
218
|
+
}
|
|
219
|
+
return this.uvarInstSets[varIndex] ?? null;
|
|
220
|
+
}
|
|
221
|
+
|
|
222
|
+
resetTheOne() {
|
|
223
|
+
this.theOne = null;
|
|
224
|
+
this.uvarInstSets = null;
|
|
225
|
+
}
|
|
226
|
+
}
|
|
227
|
+
|
|
228
|
+
type Polarity = "pos" | "neg";
|
|
229
|
+
|
|
230
|
+
// quantifier_analyzer.
|
|
231
|
+
// One analyzer runs per quantifier and records what it learns in the quantifier's info.
|
|
232
|
+
export class QuantifierAnalyzer {
|
|
233
|
+
private posCache = new Set<number>();
|
|
234
|
+
private negCache = new Set<number>();
|
|
235
|
+
private ftodo: [number, Polarity][] = [];
|
|
236
|
+
private ttodo: number[] = [];
|
|
237
|
+
|
|
238
|
+
constructor(
|
|
239
|
+
private manager: AstManager,
|
|
240
|
+
private rewriter: Rewriter,
|
|
241
|
+
private info: QuantifierInfo,
|
|
242
|
+
) {}
|
|
243
|
+
|
|
244
|
+
private isGround(expr: number) {
|
|
245
|
+
return this.manager.isGround(expr);
|
|
246
|
+
}
|
|
247
|
+
|
|
248
|
+
private isVar(expr: number) {
|
|
249
|
+
return this.manager.kinds[expr] === KIND_VAR;
|
|
250
|
+
}
|
|
251
|
+
|
|
252
|
+
// poly_rewriter::is_var_plus_ground.
|
|
253
|
+
private isVarPlusGround(expr: number) {
|
|
254
|
+
const manager = this.manager;
|
|
255
|
+
if (manager.getOp(expr) !== OP_ADD || this.isGround(expr)) return undefined;
|
|
256
|
+
const args: number[] = [];
|
|
257
|
+
let variable: number | undefined;
|
|
258
|
+
let isInverted = false;
|
|
259
|
+
let current = expr;
|
|
260
|
+
for (let isStopped = false; !isStopped;) {
|
|
261
|
+
let arg: number;
|
|
262
|
+
if (manager.getOp(current) === OP_ADD) {
|
|
263
|
+
arg = manager.getArg(current, 0);
|
|
264
|
+
current = manager.getArg(current, 1);
|
|
265
|
+
} else {
|
|
266
|
+
arg = current;
|
|
267
|
+
isStopped = true;
|
|
268
|
+
}
|
|
269
|
+
const negated = this.manager.getTimesMinusOneArg(arg);
|
|
270
|
+
if (this.isGround(arg)) args.push(arg);
|
|
271
|
+
else if (this.isVar(arg)) {
|
|
272
|
+
if (variable !== undefined) return undefined;
|
|
273
|
+
variable = arg;
|
|
274
|
+
} else if (negated !== undefined && this.isVar(negated)) {
|
|
275
|
+
if (variable !== undefined) return undefined;
|
|
276
|
+
variable = negated;
|
|
277
|
+
isInverted = true;
|
|
278
|
+
} else return undefined;
|
|
279
|
+
}
|
|
280
|
+
if (variable === undefined) return undefined;
|
|
281
|
+
const term = args.length === 1 ? args[0] : this.rewriter.mkAdd(args);
|
|
282
|
+
return { variable, term, isInverted };
|
|
283
|
+
}
|
|
284
|
+
|
|
285
|
+
private mkSub(first: number, second: number) {
|
|
286
|
+
return this.rewriter.mkSub(first, second);
|
|
287
|
+
}
|
|
288
|
+
|
|
289
|
+
private mkAdd(first: number, second: number) {
|
|
290
|
+
return this.rewriter.mkAdd([first, second]);
|
|
291
|
+
}
|
|
292
|
+
|
|
293
|
+
private isVarAndGround(lhs: number, rhs: number) {
|
|
294
|
+
if (this.isVar(lhs) && this.isGround(rhs))
|
|
295
|
+
return { variable: lhs, term: rhs, isInverted: false };
|
|
296
|
+
if (this.isVar(rhs) && this.isGround(lhs))
|
|
297
|
+
return { variable: rhs, term: lhs, isInverted: false };
|
|
298
|
+
const left = this.isVarPlusGround(lhs);
|
|
299
|
+
if (left !== undefined && this.isGround(rhs))
|
|
300
|
+
return {
|
|
301
|
+
variable: left.variable,
|
|
302
|
+
term: left.isInverted ? this.mkSub(left.term, rhs) : this.mkSub(rhs, left.term),
|
|
303
|
+
isInverted: left.isInverted,
|
|
304
|
+
};
|
|
305
|
+
const right = this.isVarPlusGround(rhs);
|
|
306
|
+
if (right !== undefined && this.isGround(lhs))
|
|
307
|
+
return {
|
|
308
|
+
variable: right.variable,
|
|
309
|
+
term: right.isInverted ? this.mkSub(right.term, lhs) : this.mkSub(lhs, right.term),
|
|
310
|
+
isInverted: right.isInverted,
|
|
311
|
+
};
|
|
312
|
+
return undefined;
|
|
313
|
+
}
|
|
314
|
+
|
|
315
|
+
private isVarMinusVar(expr: number) {
|
|
316
|
+
const manager = this.manager;
|
|
317
|
+
if (manager.getOp(expr) !== OP_ADD) return undefined;
|
|
318
|
+
let first = manager.getArg(expr, 0);
|
|
319
|
+
let second = manager.getArg(expr, 1);
|
|
320
|
+
if (!this.isVar(first)) [first, second] = [second, first];
|
|
321
|
+
if (!this.isVar(first)) return undefined;
|
|
322
|
+
const negated = this.manager.getTimesMinusOneArg(second);
|
|
323
|
+
if (negated === undefined || !this.isVar(negated)) return undefined;
|
|
324
|
+
return [first, negated];
|
|
325
|
+
}
|
|
326
|
+
|
|
327
|
+
private isZero(expr: number) {
|
|
328
|
+
return this.manager.getNumeral(expr) === 0n;
|
|
329
|
+
}
|
|
330
|
+
|
|
331
|
+
private isVarAndVar(lhs: number, rhs: number) {
|
|
332
|
+
if (this.isVar(lhs) && this.isVar(rhs)) return [lhs, rhs];
|
|
333
|
+
const left = this.isVarMinusVar(lhs);
|
|
334
|
+
if (left !== undefined && this.isZero(rhs)) return left;
|
|
335
|
+
const right = this.isVarMinusVar(rhs);
|
|
336
|
+
if (right !== undefined && this.isZero(lhs)) return right;
|
|
337
|
+
return undefined;
|
|
338
|
+
}
|
|
339
|
+
|
|
340
|
+
private isLeGe(expr: number) {
|
|
341
|
+
const op = this.manager.getOp(expr);
|
|
342
|
+
return op === OP_LE || op === OP_GE;
|
|
343
|
+
}
|
|
344
|
+
|
|
345
|
+
private isXGleTAtom(atom: number, isNegated: boolean) {
|
|
346
|
+
const manager = this.manager;
|
|
347
|
+
if (manager.kinds[atom] !== KIND_APP || !this.isLeGe(atom)) return undefined;
|
|
348
|
+
const found = this.isVarAndGround(manager.getArg(atom, 0), manager.getArg(atom, 1));
|
|
349
|
+
if (found === undefined) return undefined;
|
|
350
|
+
if (isNegated) return { variable: found.variable, term: found.term };
|
|
351
|
+
const isLe = (manager.getOp(atom) === OP_LE) !== found.isInverted;
|
|
352
|
+
const one = manager.mkNumeralOfSort(Rational.one, manager.sorts[found.term]);
|
|
353
|
+
return {
|
|
354
|
+
variable: found.variable,
|
|
355
|
+
term: isLe ? this.mkAdd(found.term, one) : this.mkSub(found.term, one),
|
|
356
|
+
};
|
|
357
|
+
}
|
|
358
|
+
|
|
359
|
+
private visitFormula(expr: number, polarity: Polarity) {
|
|
360
|
+
if (this.isGround(expr)) return;
|
|
361
|
+
const cache = polarity === "pos" ? this.posCache : this.negCache;
|
|
362
|
+
if (cache.has(expr)) return;
|
|
363
|
+
this.ftodo.push([expr, polarity]);
|
|
364
|
+
cache.add(expr);
|
|
365
|
+
}
|
|
366
|
+
|
|
367
|
+
private visitTerm(expr: number) {
|
|
368
|
+
if (this.isGround(expr) || this.posCache.has(expr)) return;
|
|
369
|
+
this.ttodo.push(expr);
|
|
370
|
+
this.posCache.add(expr);
|
|
371
|
+
}
|
|
372
|
+
|
|
373
|
+
private processUApp(expr: number) {
|
|
374
|
+
const manager = this.manager;
|
|
375
|
+
const info = this.info;
|
|
376
|
+
const decl = manager.decls[expr];
|
|
377
|
+
for (let index = 0; index < manager.getNumArgs(expr); index++) {
|
|
378
|
+
const arg = manager.getArg(expr, index);
|
|
379
|
+
if (this.isVar(arg)) {
|
|
380
|
+
info.insertQInfo({ kind: "f_var", decl, argIndex: index, varIndex: manager.values[arg] });
|
|
381
|
+
continue;
|
|
382
|
+
}
|
|
383
|
+
const found = this.isVarPlusGround(arg);
|
|
384
|
+
if (found !== undefined && !found.isInverted) {
|
|
385
|
+
info.insertQInfo({
|
|
386
|
+
kind: "f_var_plus_offset",
|
|
387
|
+
decl,
|
|
388
|
+
argIndex: index,
|
|
389
|
+
varIndex: manager.values[found.variable],
|
|
390
|
+
offset: found.term,
|
|
391
|
+
});
|
|
392
|
+
continue;
|
|
393
|
+
}
|
|
394
|
+
this.visitTerm(arg);
|
|
395
|
+
}
|
|
396
|
+
}
|
|
397
|
+
|
|
398
|
+
private processApp(expr: number) {
|
|
399
|
+
const manager = this.manager;
|
|
400
|
+
const decl = manager.decls[expr];
|
|
401
|
+
if (manager.funcDecls[decl].family !== FAMILY_BASIC) this.info.ngDecls.add(decl);
|
|
402
|
+
if (manager.funcDecls[decl].family === FAMILY_USER) this.processUApp(expr);
|
|
403
|
+
else
|
|
404
|
+
for (let index = 0; index < manager.getNumArgs(expr); index++)
|
|
405
|
+
this.visitTerm(manager.getArg(expr, index));
|
|
406
|
+
}
|
|
407
|
+
|
|
408
|
+
private processTermsOnStack() {
|
|
409
|
+
const manager = this.manager;
|
|
410
|
+
for (let current = this.ttodo.pop(); current !== undefined; current = this.ttodo.pop()) {
|
|
411
|
+
if (manager.isBool(current)) {
|
|
412
|
+
this.visitFormula(current, "pos");
|
|
413
|
+
this.visitFormula(current, "neg");
|
|
414
|
+
continue;
|
|
415
|
+
}
|
|
416
|
+
if (manager.kinds[current] === KIND_APP) this.processApp(current);
|
|
417
|
+
else if (this.isVar(current)) this.info.isAuf = false;
|
|
418
|
+
}
|
|
419
|
+
}
|
|
420
|
+
|
|
421
|
+
private processLiteral(atom: number, isNegated: boolean) {
|
|
422
|
+
const manager = this.manager;
|
|
423
|
+
const info = this.info;
|
|
424
|
+
if (this.isVar(atom)) {
|
|
425
|
+
info.insertQInfo({
|
|
426
|
+
kind: "x_neq_t",
|
|
427
|
+
varIndex: manager.values[atom],
|
|
428
|
+
term: isNegated ? manager.trueExpr : manager.falseExpr,
|
|
429
|
+
});
|
|
430
|
+
return;
|
|
431
|
+
}
|
|
432
|
+
if (manager.kinds[atom] !== KIND_APP) return;
|
|
433
|
+
const isEq = manager.getOp(atom) === OP_EQ;
|
|
434
|
+
const xEqT = isEq
|
|
435
|
+
? this.isVarAndGround(manager.getArg(atom, 0), manager.getArg(atom, 1))
|
|
436
|
+
: undefined;
|
|
437
|
+
if (xEqT !== undefined) {
|
|
438
|
+
info.insertQInfo({
|
|
439
|
+
kind: isNegated ? "x_neq_t" : "x_eq_t",
|
|
440
|
+
varIndex: manager.values[xEqT.variable],
|
|
441
|
+
term: xEqT.term,
|
|
442
|
+
});
|
|
443
|
+
return;
|
|
444
|
+
}
|
|
445
|
+
const xEqY = isEq
|
|
446
|
+
? this.isVarAndVar(manager.getArg(atom, 0), manager.getArg(atom, 1))
|
|
447
|
+
: undefined;
|
|
448
|
+
if (xEqY !== undefined) {
|
|
449
|
+
if (isNegated)
|
|
450
|
+
info.insertQInfo(mkVarPair("x_neq_y", manager.values[xEqY[0]], manager.values[xEqY[1]]));
|
|
451
|
+
else {
|
|
452
|
+
info.hasXEqY = true;
|
|
453
|
+
info.insertQInfo(mkVarPair("x_eq_y", manager.values[xEqY[0]], manager.values[xEqY[1]]));
|
|
454
|
+
}
|
|
455
|
+
return;
|
|
456
|
+
}
|
|
457
|
+
const xLeY =
|
|
458
|
+
isNegated && this.isLeGe(atom)
|
|
459
|
+
? this.isVarAndVar(manager.getArg(atom, 0), manager.getArg(atom, 1))
|
|
460
|
+
: undefined;
|
|
461
|
+
if (xLeY !== undefined) {
|
|
462
|
+
info.insertQInfo(mkVarPair("x_leq_y", manager.values[xLeY[0]], manager.values[xLeY[1]]));
|
|
463
|
+
return;
|
|
464
|
+
}
|
|
465
|
+
const xGleT = this.isXGleTAtom(atom, isNegated);
|
|
466
|
+
if (xGleT !== undefined) {
|
|
467
|
+
info.insertQInfo({
|
|
468
|
+
kind: "x_gle_t",
|
|
469
|
+
varIndex: manager.values[xGleT.variable],
|
|
470
|
+
term: xGleT.term,
|
|
471
|
+
});
|
|
472
|
+
return;
|
|
473
|
+
}
|
|
474
|
+
this.processApp(atom);
|
|
475
|
+
}
|
|
476
|
+
|
|
477
|
+
private processFormulasOnStack() {
|
|
478
|
+
const manager = this.manager;
|
|
479
|
+
for (let entry = this.ftodo.pop(); entry !== undefined; entry = this.ftodo.pop()) {
|
|
480
|
+
const current = entry[0];
|
|
481
|
+
const polarity = entry[1];
|
|
482
|
+
const negated: Polarity = polarity === "pos" ? "neg" : "pos";
|
|
483
|
+
if (manager.kinds[current] === KIND_VAR) {
|
|
484
|
+
this.processLiteral(current, polarity === "neg");
|
|
485
|
+
continue;
|
|
486
|
+
}
|
|
487
|
+
if (manager.kinds[current] !== KIND_APP) continue;
|
|
488
|
+
if (manager.getFamily(current) !== FAMILY_BASIC || !manager.isBool(current)) {
|
|
489
|
+
this.processLiteral(current, polarity === "neg");
|
|
490
|
+
continue;
|
|
491
|
+
}
|
|
492
|
+
switch (manager.getOp(current)) {
|
|
493
|
+
case OP_IMPLIES:
|
|
494
|
+
this.processLiteral(manager.getArg(current, 0), negated === "neg");
|
|
495
|
+
this.processLiteral(manager.getArg(current, 1), polarity === "neg");
|
|
496
|
+
break;
|
|
497
|
+
case OP_XOR:
|
|
498
|
+
for (let index = 0; index < manager.getNumArgs(current); index++) {
|
|
499
|
+
const arg = manager.getArg(current, index);
|
|
500
|
+
this.visitFormula(arg, polarity);
|
|
501
|
+
this.visitFormula(arg, negated);
|
|
502
|
+
}
|
|
503
|
+
break;
|
|
504
|
+
case OP_OR:
|
|
505
|
+
case OP_AND:
|
|
506
|
+
for (let index = 0; index < manager.getNumArgs(current); index++) {
|
|
507
|
+
const arg = manager.getArg(current, index);
|
|
508
|
+
this.visitFormula(arg, polarity);
|
|
509
|
+
}
|
|
510
|
+
break;
|
|
511
|
+
case OP_NOT:
|
|
512
|
+
this.visitFormula(manager.getArg(current, 0), negated);
|
|
513
|
+
break;
|
|
514
|
+
case OP_ITE:
|
|
515
|
+
this.visitFormula(manager.getArg(current, 0), polarity);
|
|
516
|
+
this.visitFormula(manager.getArg(current, 0), negated);
|
|
517
|
+
this.visitFormula(manager.getArg(current, 1), polarity);
|
|
518
|
+
this.visitFormula(manager.getArg(current, 2), polarity);
|
|
519
|
+
break;
|
|
520
|
+
case OP_EQ:
|
|
521
|
+
if (manager.isBool(manager.getArg(current, 0)))
|
|
522
|
+
for (let index = 0; index < manager.getNumArgs(current); index++) {
|
|
523
|
+
const arg = manager.getArg(current, index);
|
|
524
|
+
this.visitFormula(arg, "pos");
|
|
525
|
+
this.visitFormula(arg, "neg");
|
|
526
|
+
}
|
|
527
|
+
else this.processLiteral(current, polarity === "neg");
|
|
528
|
+
break;
|
|
529
|
+
default:
|
|
530
|
+
this.processLiteral(current, polarity === "neg");
|
|
531
|
+
}
|
|
532
|
+
}
|
|
533
|
+
}
|
|
534
|
+
|
|
535
|
+
// is_clause: a disjunction of literals.
|
|
536
|
+
private isLiteral(expr: number) {
|
|
537
|
+
const manager = this.manager;
|
|
538
|
+
const atom = manager.isNot(expr) ? manager.getArg(expr, 0) : expr;
|
|
539
|
+
if (manager.kinds[atom] !== KIND_APP) return manager.kinds[atom] === KIND_VAR;
|
|
540
|
+
if (manager.getFamily(atom) !== FAMILY_BASIC) return true;
|
|
541
|
+
const op = manager.getOp(atom);
|
|
542
|
+
if (op === OP_EQ) return !manager.isBool(manager.getArg(atom, 0));
|
|
543
|
+
return manager.getNumArgs(atom) === 0;
|
|
544
|
+
}
|
|
545
|
+
|
|
546
|
+
analyze() {
|
|
547
|
+
const manager = this.manager;
|
|
548
|
+
const body = manager.getQuantifier(this.info.flatQ).body;
|
|
549
|
+
const literals = manager.getOp(body) === OP_OR ? manager.getArgs(body) : [body];
|
|
550
|
+
if (literals.every((literal) => this.isLiteral(literal))) {
|
|
551
|
+
for (const literal of literals) {
|
|
552
|
+
const isNegated = manager.isNot(literal);
|
|
553
|
+
const atom = isNegated ? manager.getArg(literal, 0) : literal;
|
|
554
|
+
if (!this.isGround(atom)) this.processLiteral(atom, isNegated);
|
|
555
|
+
}
|
|
556
|
+
} else this.visitFormula(body, "pos");
|
|
557
|
+
while (this.ftodo.length > 0 || this.ttodo.length > 0) {
|
|
558
|
+
this.processFormulasOnStack();
|
|
559
|
+
this.processTermsOnStack();
|
|
560
|
+
}
|
|
561
|
+
}
|
|
562
|
+
}
|