tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +31 -74
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +1 -44
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1026 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +615 -53
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +26 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +112 -132
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +91 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +8 -23
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,907 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
OP_ADD,
|
|
4
|
+
OP_AND,
|
|
5
|
+
OP_ARRAY_EXT,
|
|
6
|
+
OP_ARRAY_MAP,
|
|
7
|
+
OP_BADD,
|
|
8
|
+
OP_BAND,
|
|
9
|
+
OP_BCOMP,
|
|
10
|
+
OP_BMUL,
|
|
11
|
+
OP_BOR,
|
|
12
|
+
OP_BXNOR,
|
|
13
|
+
OP_BXOR,
|
|
14
|
+
OP_EQ,
|
|
15
|
+
OP_MUL,
|
|
16
|
+
OP_OR,
|
|
17
|
+
OP_XOR,
|
|
18
|
+
} from "../ast";
|
|
19
|
+
import { CgTable } from "../cg-table";
|
|
20
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
21
|
+
|
|
22
|
+
export const NULL_THEORY_VAR = -1;
|
|
23
|
+
export const NULL_BOOL_VAR = -1;
|
|
24
|
+
|
|
25
|
+
const J_AXIOM = 0;
|
|
26
|
+
export const J_CONGRUENCE = 1;
|
|
27
|
+
export const J_EXTERNAL = 2;
|
|
28
|
+
|
|
29
|
+
export interface Justification {
|
|
30
|
+
readonly kind: number;
|
|
31
|
+
readonly isCommutative: boolean;
|
|
32
|
+
readonly external: number;
|
|
33
|
+
}
|
|
34
|
+
|
|
35
|
+
export const AXIOM: Justification = {
|
|
36
|
+
kind: J_AXIOM,
|
|
37
|
+
isCommutative: false,
|
|
38
|
+
external: 0,
|
|
39
|
+
};
|
|
40
|
+
|
|
41
|
+
const CONGRUENCES: readonly Justification[] = [
|
|
42
|
+
{ kind: J_CONGRUENCE, isCommutative: false, external: 0 },
|
|
43
|
+
{ kind: J_CONGRUENCE, isCommutative: true, external: 0 },
|
|
44
|
+
];
|
|
45
|
+
|
|
46
|
+
export const mkExternal = (external: number): Justification => ({
|
|
47
|
+
kind: J_EXTERNAL,
|
|
48
|
+
isCommutative: false,
|
|
49
|
+
external,
|
|
50
|
+
});
|
|
51
|
+
|
|
52
|
+
interface ThVar {
|
|
53
|
+
id: number;
|
|
54
|
+
thVar: number;
|
|
55
|
+
}
|
|
56
|
+
|
|
57
|
+
export class Enode {
|
|
58
|
+
root: Enode = this;
|
|
59
|
+
next: Enode = this;
|
|
60
|
+
target: Enode | null = null;
|
|
61
|
+
cg: Enode = this;
|
|
62
|
+
parents: Enode[] = [];
|
|
63
|
+
justification = AXIOM;
|
|
64
|
+
litJustification = AXIOM;
|
|
65
|
+
boolVar = NULL_BOOL_VAR;
|
|
66
|
+
value = L_UNDEF;
|
|
67
|
+
classSize = 1;
|
|
68
|
+
thVars: ThVar[] = [];
|
|
69
|
+
isMarked1 = false;
|
|
70
|
+
isMarked2 = false;
|
|
71
|
+
isMarked3 = false;
|
|
72
|
+
isInterpreted = false;
|
|
73
|
+
isCgcEnabled = true;
|
|
74
|
+
isMergeTfEnabled = false;
|
|
75
|
+
isEquality = false;
|
|
76
|
+
isRelevant = false;
|
|
77
|
+
isShared = L_UNDEF;
|
|
78
|
+
lblHash = -1;
|
|
79
|
+
lbls = 0;
|
|
80
|
+
lblsHigh = 0;
|
|
81
|
+
plbls = 0;
|
|
82
|
+
plblsHigh = 0;
|
|
83
|
+
|
|
84
|
+
constructor(
|
|
85
|
+
readonly owner: number,
|
|
86
|
+
readonly decl: number,
|
|
87
|
+
readonly args: readonly Enode[],
|
|
88
|
+
readonly generation: number,
|
|
89
|
+
readonly isCommutative: boolean,
|
|
90
|
+
) {}
|
|
91
|
+
|
|
92
|
+
get numArgs() {
|
|
93
|
+
return this.args.length;
|
|
94
|
+
}
|
|
95
|
+
|
|
96
|
+
get isCommutativeTable() {
|
|
97
|
+
return this.isCommutative;
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
getArg(index: number) {
|
|
101
|
+
return this.args[index];
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
get isRoot() {
|
|
105
|
+
return this.root === this;
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
get isCgr() {
|
|
109
|
+
return this.cg === this;
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
get mergeTf() {
|
|
113
|
+
return (
|
|
114
|
+
this.isMergeTfEnabled &&
|
|
115
|
+
(this.classSize > 1 || this.parents.length > 0 || this.args.length > 0)
|
|
116
|
+
);
|
|
117
|
+
}
|
|
118
|
+
|
|
119
|
+
getThVar(id: number) {
|
|
120
|
+
for (const entry of this.thVars) if (entry.id === id) return entry.thVar;
|
|
121
|
+
return NULL_THEORY_VAR;
|
|
122
|
+
}
|
|
123
|
+
|
|
124
|
+
hasThVars() {
|
|
125
|
+
return this.thVars.length > 0;
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
addThVar(thVar: number, id: number) {
|
|
129
|
+
this.thVars.push({ id, thVar });
|
|
130
|
+
}
|
|
131
|
+
|
|
132
|
+
replaceThVar(thVar: number, id: number) {
|
|
133
|
+
for (const entry of this.thVars) if (entry.id === id) entry.thVar = thVar;
|
|
134
|
+
}
|
|
135
|
+
|
|
136
|
+
delThVar(id: number) {
|
|
137
|
+
const index = this.thVars.findIndex((entry) => entry.id === id);
|
|
138
|
+
if (index !== -1) this.thVars.splice(index, 1);
|
|
139
|
+
}
|
|
140
|
+
|
|
141
|
+
classGeneration() {
|
|
142
|
+
let generation = this.generation;
|
|
143
|
+
for (const node of getClass(this)) generation = Math.min(node.generation, generation);
|
|
144
|
+
return generation;
|
|
145
|
+
}
|
|
146
|
+
|
|
147
|
+
congruent(other: Enode) {
|
|
148
|
+
if (this.decl !== other.decl || this.args.length !== other.args.length) return false;
|
|
149
|
+
if (
|
|
150
|
+
this.isCommutative &&
|
|
151
|
+
this.args[0].root === other.args[1].root &&
|
|
152
|
+
this.args[1].root === other.args[0].root
|
|
153
|
+
)
|
|
154
|
+
return true;
|
|
155
|
+
for (let index = this.args.length; index-- > 0;)
|
|
156
|
+
if (this.args[index].root !== other.args[index].root) return false;
|
|
157
|
+
return true;
|
|
158
|
+
}
|
|
159
|
+
}
|
|
160
|
+
|
|
161
|
+
const getClosestThVar = (node: Enode, id: number) => {
|
|
162
|
+
for (let current: Enode | null = node; current !== null; current = current.target) {
|
|
163
|
+
const thVar = current.getThVar(id);
|
|
164
|
+
if (thVar !== NULL_THEORY_VAR) return thVar;
|
|
165
|
+
}
|
|
166
|
+
return NULL_THEORY_VAR;
|
|
167
|
+
};
|
|
168
|
+
|
|
169
|
+
const reverseJustification = (node: Enode) => {
|
|
170
|
+
let current = node.target;
|
|
171
|
+
let previous = node;
|
|
172
|
+
let justification = node.justification;
|
|
173
|
+
previous.target = null;
|
|
174
|
+
previous.justification = AXIOM;
|
|
175
|
+
while (current !== null) {
|
|
176
|
+
const nextCurrent: Enode | null = current.target;
|
|
177
|
+
const nextJustification = current.justification;
|
|
178
|
+
current.target = previous;
|
|
179
|
+
current.justification = justification;
|
|
180
|
+
previous = current;
|
|
181
|
+
justification = nextJustification;
|
|
182
|
+
current = nextCurrent;
|
|
183
|
+
}
|
|
184
|
+
};
|
|
185
|
+
|
|
186
|
+
export const getClass = function* (node: Enode) {
|
|
187
|
+
let current = node;
|
|
188
|
+
do {
|
|
189
|
+
yield current;
|
|
190
|
+
current = current.next;
|
|
191
|
+
} while (current !== node);
|
|
192
|
+
};
|
|
193
|
+
|
|
194
|
+
export interface ThEq {
|
|
195
|
+
readonly id: number;
|
|
196
|
+
readonly v1: number;
|
|
197
|
+
readonly v2: number;
|
|
198
|
+
// child for an equality, the equality atom for a disequality
|
|
199
|
+
readonly child: Enode;
|
|
200
|
+
readonly root: Enode | null;
|
|
201
|
+
}
|
|
202
|
+
|
|
203
|
+
const U_ADD_NODE = 0;
|
|
204
|
+
const U_SET_PARENT = 1;
|
|
205
|
+
const U_TOGGLE_CGC = 2;
|
|
206
|
+
const U_TOGGLE_MERGE_TF = 3;
|
|
207
|
+
const U_ADD_TH_VAR = 4;
|
|
208
|
+
const U_REPLACE_TH_VAR = 5;
|
|
209
|
+
const U_NEW_TH_EQ = 6;
|
|
210
|
+
const U_NEW_TH_EQ_QHEAD = 7;
|
|
211
|
+
const U_INCONSISTENT = 8;
|
|
212
|
+
const U_VALUE_ASSIGNMENT = 9;
|
|
213
|
+
const U_LBL_HASH = 10;
|
|
214
|
+
const U_LBL_SET = 11;
|
|
215
|
+
const U_UPDATE_CHILDREN = 12;
|
|
216
|
+
const U_SET_RELEVANT = 13;
|
|
217
|
+
|
|
218
|
+
interface UpdateRecord {
|
|
219
|
+
tag: number;
|
|
220
|
+
r1: Enode | null;
|
|
221
|
+
n1: Enode | null;
|
|
222
|
+
num: number;
|
|
223
|
+
num2: number;
|
|
224
|
+
}
|
|
225
|
+
|
|
226
|
+
const TO_MERGE_PLAIN = 0;
|
|
227
|
+
const TO_MERGE_COMM = 1;
|
|
228
|
+
const TO_ADD_LITERAL = 2;
|
|
229
|
+
|
|
230
|
+
interface ToMerge {
|
|
231
|
+
a: Enode;
|
|
232
|
+
b: Enode | null;
|
|
233
|
+
kind: number;
|
|
234
|
+
}
|
|
235
|
+
|
|
236
|
+
// func_decl_info::is_commutative, which the decl plugins set by family and kind.
|
|
237
|
+
export const isCommutativeDecl = (manager: AstManager, decl: number): boolean => {
|
|
238
|
+
const funcDecl = manager.funcDecls[decl];
|
|
239
|
+
switch (funcDecl.op) {
|
|
240
|
+
case OP_EQ:
|
|
241
|
+
case OP_AND:
|
|
242
|
+
case OP_OR:
|
|
243
|
+
case OP_XOR:
|
|
244
|
+
case OP_ADD:
|
|
245
|
+
case OP_MUL:
|
|
246
|
+
case OP_BADD:
|
|
247
|
+
case OP_BMUL:
|
|
248
|
+
case OP_BAND:
|
|
249
|
+
case OP_BOR:
|
|
250
|
+
case OP_BXOR:
|
|
251
|
+
case OP_BXNOR:
|
|
252
|
+
case OP_BCOMP:
|
|
253
|
+
case OP_ARRAY_EXT:
|
|
254
|
+
return true;
|
|
255
|
+
case OP_ARRAY_MAP:
|
|
256
|
+
return isCommutativeDecl(manager, funcDecl.parameters[0]);
|
|
257
|
+
default:
|
|
258
|
+
return false;
|
|
259
|
+
}
|
|
260
|
+
};
|
|
261
|
+
|
|
262
|
+
export class Egraph {
|
|
263
|
+
readonly nodes: Enode[] = [];
|
|
264
|
+
private toMerge: ToMerge[] = [];
|
|
265
|
+
private table = new CgTable<Enode>();
|
|
266
|
+
private updates: UpdateRecord[] = [];
|
|
267
|
+
private scopes: number[] = [];
|
|
268
|
+
private expr2enode: (Enode | undefined)[] = [];
|
|
269
|
+
private decl2enodes = new Map<number, Enode[]>();
|
|
270
|
+
private numScopes = 0;
|
|
271
|
+
isInconsistent = false;
|
|
272
|
+
private n1: Enode | null = null;
|
|
273
|
+
private n2: Enode | null = null;
|
|
274
|
+
private conflictJustification = AXIOM;
|
|
275
|
+
private newThEqsQhead = 0;
|
|
276
|
+
private newThEqs: ThEq[] = [];
|
|
277
|
+
private thPropagatesDiseqs: boolean[] = [];
|
|
278
|
+
private todo: Enode[] = [];
|
|
279
|
+
usesCongruence = false;
|
|
280
|
+
isDefaultRelevant = true;
|
|
281
|
+
readonly onMerge: ((root: Enode, other: Enode) => void)[] = [];
|
|
282
|
+
onPropagateLiteral: ((lit: Enode, ante: Enode | null) => void) | null = null;
|
|
283
|
+
onMake: ((node: Enode) => void) | null = null;
|
|
284
|
+
readonly stats = {
|
|
285
|
+
merges: 0,
|
|
286
|
+
thEqs: 0,
|
|
287
|
+
thDiseqs: 0,
|
|
288
|
+
lits: 0,
|
|
289
|
+
eqs: 0,
|
|
290
|
+
conflicts: 0,
|
|
291
|
+
};
|
|
292
|
+
|
|
293
|
+
constructor(private manager: AstManager) {}
|
|
294
|
+
|
|
295
|
+
private push(tag: number, r1: Enode | null, n1: Enode | null = null, num = 0) {
|
|
296
|
+
this.updates.push({ tag, r1, n1, num, num2: 0 });
|
|
297
|
+
}
|
|
298
|
+
|
|
299
|
+
find(expr: number) {
|
|
300
|
+
return this.expr2enode[expr];
|
|
301
|
+
}
|
|
302
|
+
|
|
303
|
+
findCongruent(decl: number, args: readonly Enode[]) {
|
|
304
|
+
return this.table.findFor(
|
|
305
|
+
decl,
|
|
306
|
+
args,
|
|
307
|
+
args.length === 2 && isCommutativeDecl(this.manager, decl),
|
|
308
|
+
);
|
|
309
|
+
}
|
|
310
|
+
|
|
311
|
+
enodesOf(decl: number) {
|
|
312
|
+
return this.decl2enodes.get(decl) ?? [];
|
|
313
|
+
}
|
|
314
|
+
|
|
315
|
+
get numNodes() {
|
|
316
|
+
return this.nodes.length;
|
|
317
|
+
}
|
|
318
|
+
|
|
319
|
+
private forcePush() {
|
|
320
|
+
for (; this.numScopes > 0; this.numScopes--) {
|
|
321
|
+
this.scopes.push(this.updates.length);
|
|
322
|
+
this.push(U_NEW_TH_EQ_QHEAD, null, null, this.newThEqsQhead);
|
|
323
|
+
}
|
|
324
|
+
}
|
|
325
|
+
|
|
326
|
+
private mkEnode(expr: number, generation: number, args: readonly Enode[]) {
|
|
327
|
+
const manager = this.manager;
|
|
328
|
+
const isApp = manager.isApp(expr);
|
|
329
|
+
const decl = isApp ? manager.decls[expr] : -1;
|
|
330
|
+
const node = new Enode(
|
|
331
|
+
expr,
|
|
332
|
+
decl,
|
|
333
|
+
args,
|
|
334
|
+
generation,
|
|
335
|
+
args.length === 2 && isApp && isCommutativeDecl(manager, decl),
|
|
336
|
+
);
|
|
337
|
+
if (this.isDefaultRelevant) node.isRelevant = true;
|
|
338
|
+
this.nodes.push(node);
|
|
339
|
+
if (isApp && args.length > 0) {
|
|
340
|
+
const enodes = this.decl2enodes.get(decl);
|
|
341
|
+
if (enodes === undefined) this.decl2enodes.set(decl, [node]);
|
|
342
|
+
else enodes.push(node);
|
|
343
|
+
}
|
|
344
|
+
while (this.expr2enode.length < expr) this.expr2enode.push(undefined);
|
|
345
|
+
this.expr2enode[expr] = node;
|
|
346
|
+
manager.incRef(expr);
|
|
347
|
+
this.push(U_ADD_NODE, node);
|
|
348
|
+
for (const arg of args) {
|
|
349
|
+
this.setCgcEnabled(arg, true);
|
|
350
|
+
arg.root.isShared = L_UNDEF;
|
|
351
|
+
}
|
|
352
|
+
return node;
|
|
353
|
+
}
|
|
354
|
+
|
|
355
|
+
mk(expr: number, generation: number, args: readonly Enode[]) {
|
|
356
|
+
this.forcePush();
|
|
357
|
+
const manager = this.manager;
|
|
358
|
+
const node = this.mkEnode(expr, generation, args);
|
|
359
|
+
if (args.length === 0 && manager.isUniqueValue(expr)) node.isInterpreted = true;
|
|
360
|
+
this.onMake?.(node);
|
|
361
|
+
if (args.length === 0) return node;
|
|
362
|
+
if (manager.getOp(expr) === OP_EQ && !manager.isBool(args[0].owner)) {
|
|
363
|
+
node.isEquality = true;
|
|
364
|
+
this.reinsertEquality(node);
|
|
365
|
+
}
|
|
366
|
+
const other = this.insertTable(node);
|
|
367
|
+
if (other === node) this.updateChildren(node);
|
|
368
|
+
else this.pushMerge(node, other, this.isComm(node, other));
|
|
369
|
+
return node;
|
|
370
|
+
}
|
|
371
|
+
|
|
372
|
+
private isComm(node: Enode, other: Enode) {
|
|
373
|
+
return node.isCommutative && node.args[0].root !== other.args[0].root;
|
|
374
|
+
}
|
|
375
|
+
|
|
376
|
+
private insertTable(node: Enode) {
|
|
377
|
+
const other = this.table.insert(node);
|
|
378
|
+
node.cg = other;
|
|
379
|
+
return other;
|
|
380
|
+
}
|
|
381
|
+
|
|
382
|
+
private reinsertEquality(node: Enode) {
|
|
383
|
+
if (node.value !== L_TRUE && node.args[0].root === node.args[1].root) {
|
|
384
|
+
this.queueLiteral(node, null);
|
|
385
|
+
if (node.value === L_FALSE && this.onPropagateLiteral === null)
|
|
386
|
+
this.setConflict(node.args[0], node.args[1], node.litJustification);
|
|
387
|
+
}
|
|
388
|
+
}
|
|
389
|
+
|
|
390
|
+
private queueLiteral(node: Enode, ante: Enode | null) {
|
|
391
|
+
if (this.onPropagateLiteral !== null)
|
|
392
|
+
this.toMerge.push({ a: node, b: ante, kind: TO_ADD_LITERAL });
|
|
393
|
+
}
|
|
394
|
+
|
|
395
|
+
private updateChildren(node: Enode) {
|
|
396
|
+
for (const child of node.args) child.root.parents.push(node);
|
|
397
|
+
this.push(U_UPDATE_CHILDREN, node);
|
|
398
|
+
}
|
|
399
|
+
|
|
400
|
+
private pushMerge(a: Enode, b: Enode, isComm: boolean) {
|
|
401
|
+
this.toMerge.push({ a, b, kind: isComm ? TO_MERGE_COMM : TO_MERGE_PLAIN });
|
|
402
|
+
}
|
|
403
|
+
|
|
404
|
+
pushScope() {
|
|
405
|
+
if (this.canPropagate()) this.propagate();
|
|
406
|
+
this.numScopes++;
|
|
407
|
+
}
|
|
408
|
+
|
|
409
|
+
canPropagate() {
|
|
410
|
+
return this.toMerge.length > 0;
|
|
411
|
+
}
|
|
412
|
+
|
|
413
|
+
private addThEq(id: number, v1: number, v2: number, child: Enode, root: Enode) {
|
|
414
|
+
this.newThEqs.push({ id, v1, v2, child, root });
|
|
415
|
+
this.push(U_NEW_TH_EQ, null);
|
|
416
|
+
this.stats.thEqs++;
|
|
417
|
+
}
|
|
418
|
+
|
|
419
|
+
addThDiseq(id: number, v1: number, v2: number, eq: Enode) {
|
|
420
|
+
if (!this.thPropagatesDiseqs[id]) return;
|
|
421
|
+
this.newThEqs.push({ id, v1, v2, child: eq, root: null });
|
|
422
|
+
this.push(U_NEW_TH_EQ, null);
|
|
423
|
+
this.stats.thDiseqs++;
|
|
424
|
+
}
|
|
425
|
+
|
|
426
|
+
private addLiteral(node: Enode, ante: Enode | null) {
|
|
427
|
+
const onPropagate = this.onPropagateLiteral;
|
|
428
|
+
if (onPropagate === null) return;
|
|
429
|
+
if (ante === null) this.stats.eqs++;
|
|
430
|
+
else this.stats.lits++;
|
|
431
|
+
if (ante === null) onPropagate(node, ante);
|
|
432
|
+
else if (this.manager.isTrue(ante.owner) || this.manager.isFalse(ante.owner)) {
|
|
433
|
+
for (const other of getClass(node)) if (other !== ante) onPropagate(other, ante);
|
|
434
|
+
} else
|
|
435
|
+
for (const other of getClass(node)) if (other.value !== ante.value) onPropagate(other, ante);
|
|
436
|
+
}
|
|
437
|
+
|
|
438
|
+
newDiseq(node: Enode) {
|
|
439
|
+
const arg1 = node.args[0];
|
|
440
|
+
const arg2 = node.args[1];
|
|
441
|
+
const r1 = arg1.root;
|
|
442
|
+
const r2 = arg2.root;
|
|
443
|
+
if (r1 === r2) {
|
|
444
|
+
this.addLiteral(node, null);
|
|
445
|
+
return;
|
|
446
|
+
}
|
|
447
|
+
if (!r1.hasThVars() || !r2.hasThVars()) return;
|
|
448
|
+
if (r1.thVars.length === 1 && r2.thVars.length === 1 && r1.thVars[0].id === r2.thVars[0].id) {
|
|
449
|
+
const id = r1.thVars[0].id;
|
|
450
|
+
if (!this.thPropagatesDiseqs[id]) return;
|
|
451
|
+
this.addThDiseq(id, getClosestThVar(arg1, id), getClosestThVar(arg2, id), node);
|
|
452
|
+
return;
|
|
453
|
+
}
|
|
454
|
+
for (const p of r1.thVars) {
|
|
455
|
+
if (!this.thPropagatesDiseqs[p.id]) continue;
|
|
456
|
+
for (const q of r2.thVars) if (p.id === q.id) this.addThDiseq(p.id, p.thVar, q.thVar, node);
|
|
457
|
+
}
|
|
458
|
+
}
|
|
459
|
+
|
|
460
|
+
private addThDiseqs(id: number, v1: number, root: Enode) {
|
|
461
|
+
if (!this.thPropagatesDiseqs[id]) return;
|
|
462
|
+
for (const parent of root.parents) {
|
|
463
|
+
if (!parent.isEquality || parent.value !== L_FALSE) continue;
|
|
464
|
+
const other = (root === parent.args[0].root ? parent.args[1] : parent.args[0]).root;
|
|
465
|
+
const v2 = getClosestThVar(other, id);
|
|
466
|
+
if (v2 !== NULL_THEORY_VAR) this.addThDiseq(id, v1, v2, parent);
|
|
467
|
+
}
|
|
468
|
+
}
|
|
469
|
+
|
|
470
|
+
setThPropagatesDiseqs(id: number) {
|
|
471
|
+
while (this.thPropagatesDiseqs.length <= id) this.thPropagatesDiseqs.push(false);
|
|
472
|
+
this.thPropagatesDiseqs[id] = true;
|
|
473
|
+
}
|
|
474
|
+
|
|
475
|
+
addThVar(node: Enode, thVar: number, id: number) {
|
|
476
|
+
this.forcePush();
|
|
477
|
+
const old = node.getThVar(id);
|
|
478
|
+
const root = node.root;
|
|
479
|
+
if (old === NULL_THEORY_VAR) {
|
|
480
|
+
node.addThVar(thVar, id);
|
|
481
|
+
this.push(U_ADD_TH_VAR, node, null, id);
|
|
482
|
+
if (root !== node) {
|
|
483
|
+
const rootVar = root.getThVar(id);
|
|
484
|
+
if (rootVar === NULL_THEORY_VAR) {
|
|
485
|
+
root.addThVar(thVar, id);
|
|
486
|
+
this.addThDiseqs(id, thVar, root);
|
|
487
|
+
} else this.addThEq(id, thVar, rootVar, node, root);
|
|
488
|
+
}
|
|
489
|
+
return;
|
|
490
|
+
}
|
|
491
|
+
const rootVar = root.getThVar(id);
|
|
492
|
+
node.replaceThVar(thVar, id);
|
|
493
|
+
// Deviation from Z3: the undo restores the variable of the node; Z3 records that of the root.
|
|
494
|
+
this.updates.push({
|
|
495
|
+
tag: U_REPLACE_TH_VAR,
|
|
496
|
+
r1: node,
|
|
497
|
+
n1: null,
|
|
498
|
+
num: id,
|
|
499
|
+
num2: old,
|
|
500
|
+
});
|
|
501
|
+
this.addThEq(id, thVar, rootVar, node, root);
|
|
502
|
+
}
|
|
503
|
+
|
|
504
|
+
private undoAddThVar(node: Enode, id: number) {
|
|
505
|
+
const thVar = node.getThVar(id);
|
|
506
|
+
node.delThVar(id);
|
|
507
|
+
const root = node.root;
|
|
508
|
+
if (root !== node && root.getThVar(id) === thVar) root.delThVar(id);
|
|
509
|
+
}
|
|
510
|
+
|
|
511
|
+
setMergeTfEnabled(node: Enode, isEnabled: boolean) {
|
|
512
|
+
if (!this.manager.isBool(node.owner)) return;
|
|
513
|
+
if (isEnabled !== node.mergeTf) {
|
|
514
|
+
node.isMergeTfEnabled = isEnabled;
|
|
515
|
+
this.push(U_TOGGLE_MERGE_TF, node);
|
|
516
|
+
}
|
|
517
|
+
}
|
|
518
|
+
|
|
519
|
+
setCgcEnabled(node: Enode, isEnabled: boolean) {
|
|
520
|
+
if (isEnabled === node.isCgcEnabled) return;
|
|
521
|
+
this.toggleCgcEnabled(node, false);
|
|
522
|
+
this.push(U_TOGGLE_CGC, node);
|
|
523
|
+
}
|
|
524
|
+
|
|
525
|
+
setRelevant(node: Enode) {
|
|
526
|
+
if (node.isRelevant) return;
|
|
527
|
+
node.isRelevant = true;
|
|
528
|
+
this.push(U_SET_RELEVANT, node);
|
|
529
|
+
}
|
|
530
|
+
|
|
531
|
+
private toggleCgcEnabled(node: Enode, isBacktracking: boolean) {
|
|
532
|
+
const isEnabled = !node.isCgcEnabled;
|
|
533
|
+
node.isCgcEnabled = isEnabled;
|
|
534
|
+
if (node.args.length === 0) return;
|
|
535
|
+
if (isEnabled) {
|
|
536
|
+
const other = this.insertTable(node);
|
|
537
|
+
if (other !== node && !isBacktracking) this.pushMerge(node, other, this.isComm(node, other));
|
|
538
|
+
} else if (node.isCgr) this.table.erase(node);
|
|
539
|
+
}
|
|
540
|
+
|
|
541
|
+
setValue(node: Enode, value: number, justification: Justification) {
|
|
542
|
+
if (node.value !== L_UNDEF) return;
|
|
543
|
+
this.forcePush();
|
|
544
|
+
node.value = value;
|
|
545
|
+
node.litJustification = justification;
|
|
546
|
+
this.push(U_VALUE_ASSIGNMENT, node);
|
|
547
|
+
if (node.isEquality && value === L_FALSE) this.newDiseq(node);
|
|
548
|
+
}
|
|
549
|
+
|
|
550
|
+
setLblHash(node: Enode, hash: number) {
|
|
551
|
+
this.push(U_LBL_HASH, node, null, node.lblHash);
|
|
552
|
+
node.lblHash = hash;
|
|
553
|
+
const root = node.root;
|
|
554
|
+
const isLow = hash < 32;
|
|
555
|
+
const bit = 1 << hash;
|
|
556
|
+
if (((isLow ? root.lbls : root.lblsHigh) & bit) !== 0) return;
|
|
557
|
+
this.updates.push({ tag: U_LBL_SET, r1: root, n1: null, num: root.lbls, num2: root.lblsHigh });
|
|
558
|
+
if (isLow) root.lbls |= bit;
|
|
559
|
+
else root.lblsHigh |= bit;
|
|
560
|
+
}
|
|
561
|
+
|
|
562
|
+
popScopes(numScopes: number) {
|
|
563
|
+
if (numScopes <= this.numScopes) {
|
|
564
|
+
this.numScopes -= numScopes;
|
|
565
|
+
this.toMerge = [];
|
|
566
|
+
return;
|
|
567
|
+
}
|
|
568
|
+
numScopes -= this.numScopes;
|
|
569
|
+
this.numScopes = 0;
|
|
570
|
+
const oldLim = this.scopes.length - numScopes;
|
|
571
|
+
const numUpdates = this.scopes[oldLim];
|
|
572
|
+
const manager = this.manager;
|
|
573
|
+
for (let index = this.updates.length; index-- > numUpdates;) {
|
|
574
|
+
const record = this.updates[index];
|
|
575
|
+
const r1 = record.r1 as Enode;
|
|
576
|
+
switch (record.tag) {
|
|
577
|
+
case U_ADD_NODE: {
|
|
578
|
+
const node = this.nodes.pop() as Enode;
|
|
579
|
+
if (node.args.length > 0 && node.isCgr) this.table.erase(node);
|
|
580
|
+
this.expr2enode[node.owner] = undefined;
|
|
581
|
+
manager.decRef(node.owner);
|
|
582
|
+
if (node.args.length > 0) this.decl2enodes.get(node.decl)?.pop();
|
|
583
|
+
break;
|
|
584
|
+
}
|
|
585
|
+
case U_TOGGLE_CGC:
|
|
586
|
+
this.toggleCgcEnabled(r1, true);
|
|
587
|
+
break;
|
|
588
|
+
case U_TOGGLE_MERGE_TF:
|
|
589
|
+
r1.isMergeTfEnabled = !r1.mergeTf;
|
|
590
|
+
break;
|
|
591
|
+
case U_SET_PARENT:
|
|
592
|
+
this.undoEq(r1, record.n1 as Enode, record.num);
|
|
593
|
+
break;
|
|
594
|
+
case U_ADD_TH_VAR:
|
|
595
|
+
this.undoAddThVar(r1, record.num);
|
|
596
|
+
break;
|
|
597
|
+
case U_REPLACE_TH_VAR:
|
|
598
|
+
r1.replaceThVar(record.num2, record.num);
|
|
599
|
+
break;
|
|
600
|
+
case U_NEW_TH_EQ:
|
|
601
|
+
this.newThEqs.pop();
|
|
602
|
+
break;
|
|
603
|
+
case U_NEW_TH_EQ_QHEAD:
|
|
604
|
+
this.newThEqsQhead = record.num;
|
|
605
|
+
break;
|
|
606
|
+
case U_INCONSISTENT:
|
|
607
|
+
this.isInconsistent = false;
|
|
608
|
+
break;
|
|
609
|
+
case U_VALUE_ASSIGNMENT:
|
|
610
|
+
r1.value = L_UNDEF;
|
|
611
|
+
break;
|
|
612
|
+
case U_LBL_HASH:
|
|
613
|
+
r1.lblHash = record.num;
|
|
614
|
+
break;
|
|
615
|
+
case U_LBL_SET:
|
|
616
|
+
r1.lbls = record.num;
|
|
617
|
+
r1.lblsHigh = record.num2;
|
|
618
|
+
break;
|
|
619
|
+
case U_SET_RELEVANT:
|
|
620
|
+
r1.isRelevant = false;
|
|
621
|
+
break;
|
|
622
|
+
case U_UPDATE_CHILDREN:
|
|
623
|
+
for (const arg of r1.args) arg.root.parents.pop();
|
|
624
|
+
break;
|
|
625
|
+
}
|
|
626
|
+
}
|
|
627
|
+
this.updates.length = numUpdates;
|
|
628
|
+
this.scopes.length = oldLim;
|
|
629
|
+
this.toMerge = [];
|
|
630
|
+
}
|
|
631
|
+
|
|
632
|
+
merge(n1: Enode, n2: Enode, reason: number) {
|
|
633
|
+
this.mergeWith(n1, n2, mkExternal(reason));
|
|
634
|
+
}
|
|
635
|
+
|
|
636
|
+
private mergeWith(n1: Enode, n2: Enode, justification: Justification) {
|
|
637
|
+
if (!n1.isCgcEnabled && !n2.isCgcEnabled) return;
|
|
638
|
+
let r1 = n1.root;
|
|
639
|
+
let r2 = n2.root;
|
|
640
|
+
if (r1 === r2) return;
|
|
641
|
+
this.forcePush();
|
|
642
|
+
this.stats.merges++;
|
|
643
|
+
if (r1.isInterpreted && r2.isInterpreted) {
|
|
644
|
+
this.setConflict(n1, n2, justification);
|
|
645
|
+
return;
|
|
646
|
+
}
|
|
647
|
+
if (r1.value !== r2.value && r1.value !== L_UNDEF && r2.value !== L_UNDEF) {
|
|
648
|
+
this.setConflict(n1, n2, justification);
|
|
649
|
+
return;
|
|
650
|
+
}
|
|
651
|
+
if (
|
|
652
|
+
!r2.isInterpreted &&
|
|
653
|
+
(r1.classSize > r2.classSize || r1.isInterpreted || r1.value !== L_UNDEF)
|
|
654
|
+
) {
|
|
655
|
+
[r1, r2] = [r2, r1];
|
|
656
|
+
[n1, n2] = [n2, n1];
|
|
657
|
+
}
|
|
658
|
+
this.removeParents(r1);
|
|
659
|
+
this.push(U_SET_PARENT, r1, n1, r2.parents.length);
|
|
660
|
+
reverseJustification(n1);
|
|
661
|
+
n1.target = n2;
|
|
662
|
+
n1.justification = justification;
|
|
663
|
+
for (const node of getClass(n1)) node.root = r2;
|
|
664
|
+
const next = r1.next;
|
|
665
|
+
r1.next = r2.next;
|
|
666
|
+
r2.next = next;
|
|
667
|
+
r2.classSize += r1.classSize;
|
|
668
|
+
r2.isShared = L_UNDEF;
|
|
669
|
+
this.mergeThEq(r1, r2);
|
|
670
|
+
this.reinsertParents(r1, r2);
|
|
671
|
+
const manager = this.manager;
|
|
672
|
+
if (
|
|
673
|
+
justification.kind === J_CONGRUENCE &&
|
|
674
|
+
(manager.isFalse(r2.owner) || manager.isTrue(r2.owner))
|
|
675
|
+
)
|
|
676
|
+
this.addLiteral(n1, r2);
|
|
677
|
+
else if (n2.value !== L_UNDEF && n1.value !== n2.value) this.addLiteral(n1, n2);
|
|
678
|
+
else if (n1.value !== L_UNDEF && n2.value !== n1.value) this.addLiteral(n2, n1);
|
|
679
|
+
for (const onMerge of this.onMerge) onMerge(r2, r1);
|
|
680
|
+
}
|
|
681
|
+
|
|
682
|
+
private removeParents(root: Enode) {
|
|
683
|
+
for (const parent of root.parents) {
|
|
684
|
+
if (parent.isMarked1) continue;
|
|
685
|
+
if (parent.isCgcEnabled) {
|
|
686
|
+
if (!parent.isCgr) continue;
|
|
687
|
+
parent.isMarked1 = true;
|
|
688
|
+
this.table.erase(parent);
|
|
689
|
+
} else if (parent.isEquality) parent.isMarked1 = true;
|
|
690
|
+
}
|
|
691
|
+
}
|
|
692
|
+
|
|
693
|
+
private reinsertParents(r1: Enode, r2: Enode) {
|
|
694
|
+
for (const parent of r1.parents) {
|
|
695
|
+
if (!parent.isMarked1) continue;
|
|
696
|
+
parent.isMarked1 = false;
|
|
697
|
+
if (parent.isCgcEnabled) {
|
|
698
|
+
const other = this.insertTable(parent);
|
|
699
|
+
if (other !== parent) this.pushMerge(other, parent, this.isComm(other, parent));
|
|
700
|
+
else r2.parents.push(parent);
|
|
701
|
+
if (parent.isEquality) this.reinsertEquality(parent);
|
|
702
|
+
} else if (parent.isEquality) {
|
|
703
|
+
r2.parents.push(parent);
|
|
704
|
+
this.reinsertEquality(parent);
|
|
705
|
+
}
|
|
706
|
+
}
|
|
707
|
+
}
|
|
708
|
+
|
|
709
|
+
private mergeThEq(node: Enode, root: Enode) {
|
|
710
|
+
for (const entry of node.thVars) {
|
|
711
|
+
const rootVar = root.getThVar(entry.id);
|
|
712
|
+
if (rootVar === NULL_THEORY_VAR) {
|
|
713
|
+
root.addThVar(entry.thVar, entry.id);
|
|
714
|
+
this.push(U_ADD_TH_VAR, root, null, entry.id);
|
|
715
|
+
this.addThDiseqs(entry.id, entry.thVar, root);
|
|
716
|
+
} else this.addThEq(entry.id, rootVar, entry.thVar, node, root);
|
|
717
|
+
}
|
|
718
|
+
}
|
|
719
|
+
|
|
720
|
+
private undoEq(r1: Enode, n1: Enode, r2NumParents: number) {
|
|
721
|
+
const r2 = r1.root;
|
|
722
|
+
r2.classSize -= r1.classSize;
|
|
723
|
+
r2.isShared = L_UNDEF;
|
|
724
|
+
const next = r1.next;
|
|
725
|
+
r1.next = r2.next;
|
|
726
|
+
r2.next = next;
|
|
727
|
+
for (let index = r2NumParents; index < r2.parents.length; index++) {
|
|
728
|
+
const parent = r2.parents[index];
|
|
729
|
+
if (parent.isCgcEnabled) this.table.erase(parent);
|
|
730
|
+
}
|
|
731
|
+
for (const node of getClass(r1)) node.root = r1;
|
|
732
|
+
for (const parent of r1.parents)
|
|
733
|
+
if (parent.isCgcEnabled && (parent.isCgr || !parent.congruent(parent.cg)))
|
|
734
|
+
this.insertTable(parent);
|
|
735
|
+
r2.parents.length = r2NumParents;
|
|
736
|
+
n1.target = null;
|
|
737
|
+
n1.justification = AXIOM;
|
|
738
|
+
reverseJustification(n1.root);
|
|
739
|
+
}
|
|
740
|
+
|
|
741
|
+
propagate() {
|
|
742
|
+
this.forcePush();
|
|
743
|
+
const toMerge = this.toMerge;
|
|
744
|
+
for (
|
|
745
|
+
let index = 0;
|
|
746
|
+
index < toMerge.length && this.manager.limit.inc() && !this.isInconsistent;
|
|
747
|
+
index++
|
|
748
|
+
) {
|
|
749
|
+
const item = toMerge[index];
|
|
750
|
+
switch (item.kind) {
|
|
751
|
+
case TO_MERGE_PLAIN:
|
|
752
|
+
case TO_MERGE_COMM:
|
|
753
|
+
this.mergeWith(item.a, item.b as Enode, CONGRUENCES[item.kind]);
|
|
754
|
+
break;
|
|
755
|
+
case TO_ADD_LITERAL:
|
|
756
|
+
this.addLiteral(item.a, item.b);
|
|
757
|
+
break;
|
|
758
|
+
}
|
|
759
|
+
}
|
|
760
|
+
this.toMerge = [];
|
|
761
|
+
return this.newThEqsQhead < this.newThEqs.length || this.isInconsistent;
|
|
762
|
+
}
|
|
763
|
+
|
|
764
|
+
private setConflict(n1: Enode, n2: Enode, justification: Justification) {
|
|
765
|
+
this.stats.conflicts++;
|
|
766
|
+
if (this.isInconsistent) return;
|
|
767
|
+
this.isInconsistent = true;
|
|
768
|
+
this.push(U_INCONSISTENT, null);
|
|
769
|
+
this.n1 = n1;
|
|
770
|
+
this.n2 = n2;
|
|
771
|
+
this.conflictJustification = justification;
|
|
772
|
+
}
|
|
773
|
+
|
|
774
|
+
hasThEq() {
|
|
775
|
+
return this.newThEqsQhead < this.newThEqs.length;
|
|
776
|
+
}
|
|
777
|
+
|
|
778
|
+
getThEq() {
|
|
779
|
+
return this.newThEqs[this.newThEqsQhead];
|
|
780
|
+
}
|
|
781
|
+
|
|
782
|
+
nextThEq() {
|
|
783
|
+
this.forcePush();
|
|
784
|
+
this.newThEqsQhead++;
|
|
785
|
+
}
|
|
786
|
+
|
|
787
|
+
areDiseq(a: Enode, b: Enode) {
|
|
788
|
+
const ra = a.root;
|
|
789
|
+
const rb = b.root;
|
|
790
|
+
if (ra === rb) return false;
|
|
791
|
+
if (ra.isInterpreted && rb.isInterpreted) return true;
|
|
792
|
+
if (this.manager.sorts[ra.owner] !== this.manager.sorts[rb.owner]) return true;
|
|
793
|
+
const eq = this.tmpEq(ra, rb);
|
|
794
|
+
return eq !== null && eq.root.value === L_FALSE;
|
|
795
|
+
}
|
|
796
|
+
|
|
797
|
+
tmpEq(a: Enode, b: Enode) {
|
|
798
|
+
if (a.parents.length > b.parents.length) [a, b] = [b, a];
|
|
799
|
+
for (const parent of a.parents)
|
|
800
|
+
if (parent.isEquality && (b === parent.args[0].root || b === parent.args[1].root))
|
|
801
|
+
return parent;
|
|
802
|
+
return null;
|
|
803
|
+
}
|
|
804
|
+
|
|
805
|
+
private pushCongruence(n1: Enode, n2: Enode, isComm: boolean) {
|
|
806
|
+
this.usesCongruence = true;
|
|
807
|
+
if (isComm && n1.args[0].root === n2.args[1].root && n1.args[1].root === n2.args[0].root) {
|
|
808
|
+
this.pushLca(n1.args[0], n2.args[1]);
|
|
809
|
+
this.pushLca(n1.args[1], n2.args[0]);
|
|
810
|
+
return;
|
|
811
|
+
}
|
|
812
|
+
for (let index = 0; index < n1.args.length; index++)
|
|
813
|
+
this.pushLca(n1.args[index], n2.args[index]);
|
|
814
|
+
}
|
|
815
|
+
|
|
816
|
+
private findLca(a: Enode, b: Enode) {
|
|
817
|
+
for (let node: Enode | null = a; node !== null; node = node.target) node.isMarked2 = true;
|
|
818
|
+
let lca = b;
|
|
819
|
+
while (!lca.isMarked2) lca = lca.target as Enode;
|
|
820
|
+
for (let node: Enode | null = a; node !== null; node = node.target) node.isMarked2 = false;
|
|
821
|
+
return lca;
|
|
822
|
+
}
|
|
823
|
+
|
|
824
|
+
private pushToLca(node: Enode, lca: Enode) {
|
|
825
|
+
for (let current = node; current !== lca; current = current.target as Enode)
|
|
826
|
+
this.todo.push(current);
|
|
827
|
+
}
|
|
828
|
+
|
|
829
|
+
private pushLca(a: Enode, b: Enode) {
|
|
830
|
+
const lca = this.findLca(a, b);
|
|
831
|
+
this.pushToLca(a, lca);
|
|
832
|
+
this.pushToLca(b, lca);
|
|
833
|
+
}
|
|
834
|
+
|
|
835
|
+
private pushTodo(node: Enode | null) {
|
|
836
|
+
for (let current = node; current !== null; current = current.target) this.todo.push(current);
|
|
837
|
+
}
|
|
838
|
+
|
|
839
|
+
beginExplain() {
|
|
840
|
+
this.usesCongruence = false;
|
|
841
|
+
}
|
|
842
|
+
|
|
843
|
+
endExplain() {
|
|
844
|
+
for (const node of this.todo) node.isMarked1 = false;
|
|
845
|
+
this.todo = [];
|
|
846
|
+
}
|
|
847
|
+
|
|
848
|
+
explain(justifications: number[]) {
|
|
849
|
+
this.pushTodo(this.n1);
|
|
850
|
+
this.pushTodo(this.n2);
|
|
851
|
+
this.explainJustification(
|
|
852
|
+
justifications,
|
|
853
|
+
this.n1 as Enode,
|
|
854
|
+
this.n2 as Enode,
|
|
855
|
+
this.conflictJustification,
|
|
856
|
+
);
|
|
857
|
+
this.explainTodo(justifications);
|
|
858
|
+
}
|
|
859
|
+
|
|
860
|
+
private explainJustification(
|
|
861
|
+
justifications: number[],
|
|
862
|
+
a: Enode,
|
|
863
|
+
b: Enode,
|
|
864
|
+
justification: Justification,
|
|
865
|
+
) {
|
|
866
|
+
if (justification.kind === J_EXTERNAL) justifications.push(justification.external);
|
|
867
|
+
else if (justification.kind === J_CONGRUENCE)
|
|
868
|
+
this.pushCongruence(a, b, justification.isCommutative);
|
|
869
|
+
}
|
|
870
|
+
|
|
871
|
+
explainEq(justifications: number[], a: Enode, b: Enode) {
|
|
872
|
+
const lca = this.findLca(a, b);
|
|
873
|
+
this.pushToLca(a, lca);
|
|
874
|
+
this.pushToLca(b, lca);
|
|
875
|
+
this.explainTodo(justifications);
|
|
876
|
+
}
|
|
877
|
+
|
|
878
|
+
// Returns the Boolean variable of the false equality that explains the disequality, or -1.
|
|
879
|
+
explainDiseq(justifications: number[], a: Enode, b: Enode) {
|
|
880
|
+
const ra = a.root;
|
|
881
|
+
const rb = b.root;
|
|
882
|
+
if (ra.isInterpreted && rb.isInterpreted) {
|
|
883
|
+
this.explainEq(justifications, a, ra);
|
|
884
|
+
this.explainEq(justifications, b, rb);
|
|
885
|
+
return NULL_BOOL_VAR;
|
|
886
|
+
}
|
|
887
|
+
const eq = this.tmpEq(ra, rb) as Enode;
|
|
888
|
+
this.explainEq(justifications, eq, eq.root);
|
|
889
|
+
return eq.root.boolVar;
|
|
890
|
+
}
|
|
891
|
+
|
|
892
|
+
private explainTodo(justifications: number[]) {
|
|
893
|
+
const manager = this.manager;
|
|
894
|
+
for (let index = 0; index < this.todo.length; index++) {
|
|
895
|
+
const node = this.todo[index];
|
|
896
|
+
if (node.isMarked1) continue;
|
|
897
|
+
if (node.target !== null) {
|
|
898
|
+
node.isMarked1 = true;
|
|
899
|
+
this.explainJustification(justifications, node, node.target, node.justification);
|
|
900
|
+
} else if (node.value !== L_UNDEF) {
|
|
901
|
+
node.isMarked1 = true;
|
|
902
|
+
if (manager.isTrue(node.owner) || manager.isFalse(node.owner)) continue;
|
|
903
|
+
justifications.push(node.litJustification.external);
|
|
904
|
+
}
|
|
905
|
+
}
|
|
906
|
+
}
|
|
907
|
+
}
|