tla-ts 0.0.9 → 0.0.10-dev.b4a856304
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 +29 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +28 -28
- package/dist/deciders.js +43 -43
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +72 -10
- package/dist/index.d.ts +72 -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 +116 -36
- package/dist/prove.js +116 -36
- package/dist/run.cjs +143 -31
- package/dist/run.js +143 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +128 -103
- package/dist/transfer.js +128 -103
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +7 -21
- package/src/bags.ts +99 -99
- package/src/builtins.ts +44 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check.ts +576 -300
- package/src/cli/options.ts +11 -6
- package/src/cli/run.ts +2 -2
- package/src/cli/runtime-invariants.ts +135 -0
- package/src/cli/shared.ts +20 -9
- package/src/cli/tlapm.ts +0 -12
- package/src/cli/tlc-arguments.ts +646 -0
- package/src/cli/tlc-usage.ts +362 -0
- package/src/cli/tlc.ts +538 -220
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +4 -16
- package/src/cli.ts +0 -1
- package/src/codegen.ts +191 -64
- package/src/config.ts +140 -109
- package/src/coverage.ts +837 -0
- package/src/dependencies.ts +6 -40
- package/src/dfid.ts +618 -0
- package/src/environment.ts +240 -118
- package/src/errors.ts +70 -55
- package/src/evaluate.ts +630 -297
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +10 -10
- package/src/index.ts +3 -0
- package/src/instances.ts +79 -11
- package/src/java-overrides.ts +2 -12
- package/src/json-reader.ts +456 -0
- package/src/json.ts +262 -139
- package/src/levels.ts +2 -3
- package/src/lexer.ts +17 -26
- package/src/liveness-checker.ts +10 -18
- package/src/liveness.ts +121 -49
- package/src/obligations/action.ts +4 -28
- package/src/obligations/anonymize.ts +84 -80
- package/src/obligations/equality.ts +1 -1
- package/src/obligations/expression.ts +2 -19
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +1 -11
- package/src/obligations/index.ts +0 -11
- package/src/obligations/levels.ts +4 -8
- package/src/obligations/module.ts +1 -15
- package/src/obligations/normalize.ts +5 -24
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +1 -10
- package/src/obligations/printer.ts +47 -46
- package/src/obligations/proof.ts +1 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +3 -14
- package/src/obligations/source.ts +1 -21
- package/src/obligations/subexpression.ts +5 -11
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +8 -14
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +29 -39
- package/src/parallel.ts +29 -13
- package/src/parser.ts +436 -90
- package/src/pcal/ast.ts +7 -28
- package/src/pcal/parse.ts +11 -39
- package/src/pcal/tokenize.ts +4 -20
- package/src/pcal/translate.ts +10 -42
- package/src/pcal/validate.ts +3 -21
- package/src/pretty-print.ts +1 -2
- package/src/prover/decide-pool.ts +5 -10
- package/src/prover/deciders.ts +0 -4
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +0 -6
- package/src/prover/isabelle/encode.ts +11 -23
- package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
- package/src/prover/isabelle/isar/method.ts +25 -38
- package/src/prover/isabelle/isar/proof.ts +1 -10
- package/src/prover/isabelle/isar/statement.ts +1 -6
- package/src/prover/isabelle/isar/theory.ts +15 -26
- package/src/prover/isabelle/isar/type-check.ts +11 -25
- package/src/prover/isabelle/provers/blast/blast.ts +10 -41
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +14 -42
- package/src/prover/isabelle/provers/hypsubst.ts +11 -25
- package/src/prover/isabelle/pure/bicompose.ts +16 -13
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +1 -9
- package/src/prover/isabelle/pure/drule.ts +24 -40
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +1 -7
- 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 -14
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +3 -10
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
- package/src/prover/isabelle/pure/rewriter.ts +26 -58
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +4 -12
- package/src/prover/isabelle/pure/table.ts +1 -31
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +6 -12
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +13 -36
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +9 -19
- package/src/prover/isabelle/tla/context.ts +8 -16
- package/src/prover/isabelle/tla/logic.ts +4 -11
- package/src/prover/isabelle/tla/simpdata.ts +46 -34
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +4 -36
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +0 -16
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +9 -36
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +0 -36
- package/src/prover/ptl/decide.ts +7 -12
- package/src/prover/ptl/encode.ts +14 -36
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +12 -26
- package/src/prover/smt/axioms.ts +0 -7
- package/src/prover/smt/context.ts +19 -26
- package/src/prover/smt/data.ts +51 -54
- package/src/prover/smt/encode.ts +14 -35
- package/src/prover/smt/extensionality.ts +0 -10
- package/src/prover/smt/flatten.ts +3 -22
- package/src/prover/smt/format.ts +5 -10
- package/src/prover/smt/instances.ts +0 -10
- package/src/prover/smt/rewrite.ts +66 -101
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -48
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +1 -43
- package/src/prover/smt/solver/ast-lt.ts +1 -11
- package/src/prover/smt/solver/ast-util.ts +1 -6
- package/src/prover/smt/solver/ast.ts +1 -143
- package/src/prover/smt/solver/auf-solver.ts +6 -39
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +1 -18
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/conflict-resolution.ts +0 -9
- package/src/prover/smt/solver/context.ts +4 -61
- package/src/prover/smt/solver/ctx-simplify.ts +14 -41
- package/src/prover/smt/solver/der.ts +2 -21
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +3 -34
- package/src/prover/smt/solver/enode.ts +1 -21
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
- package/src/prover/smt/solver/fingerprints.ts +1 -12
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/goal.ts +2 -14
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +1 -12
- package/src/prover/smt/solver/internalizer.ts +6 -98
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +10 -31
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +15 -36
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +35 -130
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +1 -6
- package/src/prover/smt/solver/mam-compiler.ts +14 -56
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
- package/src/prover/smt/solver/model-checker.ts +2 -36
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +3 -15
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +12 -69
- package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
- package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +3 -47
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
- package/src/prover/smt/solver/nlsat/solver.ts +7 -67
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nnf.ts +3 -38
- package/src/prover/smt/solver/pattern-inference.ts +2 -15
- package/src/prover/smt/solver/poly-rewriter.ts +3 -23
- package/src/prover/smt/solver/propagate-values.ts +1 -10
- package/src/prover/smt/solver/proto-model.ts +3 -48
- package/src/prover/smt/solver/pull-quant.ts +1 -12
- package/src/prover/smt/solver/qe-lite-der.ts +1 -29
- package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
- package/src/prover/smt/solver/qe-lite.ts +3 -33
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/quant-tactics.ts +5 -22
- package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
- package/src/prover/smt/solver/quantifier-manager.ts +1 -8
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +1 -8
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +2 -15
- package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
- package/src/prover/smt/solver/rewriter.ts +3 -85
- package/src/prover/smt/solver/rlimit.ts +2 -20
- package/src/prover/smt/solver/smtlib-parser.ts +2 -37
- package/src/prover/smt/solver/solver.ts +23 -34
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
- package/src/prover/smt/solver/theory-lra-model.ts +4 -19
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
- package/src/prover/smt/solver/theory-lra-state.ts +3 -8
- package/src/prover/smt/solver/theory-lra.ts +1 -8
- package/src/prover/smt/solver/var-subst.ts +2 -26
- package/src/prover/smt/table.ts +0 -8
- package/src/prover/tlapm/cache.ts +20 -25
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +12 -17
- package/src/prover/verdict.ts +0 -2
- package/src/prover/zenon/check/check.ts +0 -9
- 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 +0 -5
- package/src/prover/zenon/check/relations.ts +0 -13
- package/src/prover/zenon/check/rewrites.ts +0 -6
- package/src/prover/zenon/check/sets.ts +0 -3
- package/src/prover/zenon/check/terms.ts +0 -17
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +0 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +1 -26
- package/src/prover/zenon/index-table.ts +17 -38
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +1 -29
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +0 -9
- package/src/prover/zenon/mltoll.ts +54 -76
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +2 -7
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +1 -17
- package/src/prover/zenon/tla/functions.ts +57 -29
- package/src/prover/zenon/tla/llproof.ts +63 -70
- package/src/prover/zenon/tla/records.ts +56 -27
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +68 -39
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +59 -58
- package/src/randomization.ts +84 -35
- package/src/resolve.ts +18 -60
- package/src/runtime.ts +11 -4
- package/src/sany/builtins.ts +3 -4
- package/src/sany/generator.ts +119 -169
- package/src/sany/levels.ts +6 -30
- package/src/sany/lexer.ts +7 -23
- package/src/sany/linter.ts +1 -8
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +0 -31
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +29 -63
- package/src/sany/selectors.ts +15 -39
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +13 -63
- package/src/search.ts +494 -154
- package/src/simulate.ts +694 -0
- package/src/spec-description.ts +166 -48
- package/src/standard-definitions.ts +2 -3
- package/src/standard-modules.ts +264 -68
- package/src/state-graph.ts +51 -18
- package/src/subexpressions.ts +31 -5
- package/src/substitution-levels.ts +2 -3
- package/src/successors.ts +267 -77
- package/src/symmetry.ts +31 -8
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -61
- package/src/tlc/jar-data.ts +113 -6
- package/src/tlc/messages.ts +122 -37
- package/src/tlc/order.ts +33 -38
- package/src/tlc/random.ts +16 -16
- package/src/tlc/replay.ts +563 -211
- package/src/tlc/summary.ts +2 -4
- package/src/tlc/tlc-operators.ts +81 -36
- package/src/tlc/tlcext-operators.ts +138 -117
- package/src/tlc/trace-spec.ts +273 -0
- package/src/tlc/value-stream.ts +143 -0
- package/src/tlc/version.ts +2 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +481 -0
- package/src/typescript/collections.ts +600 -0
- package/src/typescript/compile.ts +65 -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 +152 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +163 -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 +165 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +826 -276
- package/src/worker.ts +7 -8
|
@@ -1,7 +1,4 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_model_finder.cpp), MIT license, see z3-license.txt.
|
|
2
|
-
// sets and the AUF solver of the model finder: the solver groups the argument positions and
|
|
3
|
-
// variables that must share an instantiation set, and each group gets a projection function that
|
|
4
|
-
// maps any value to the value of a term in its set.
|
|
1
|
+
// Ported from Z3 (src/smt/smt_model_finder.cpp), MIT license, see z3-license.txt.
|
|
5
2
|
import { SmtInvariantError } from "../../../errors";
|
|
6
3
|
import { OP_ITE, OP_LT, SORT_BOOL, SORT_INT, isArithSort, type AstManager } from "./ast";
|
|
7
4
|
import { combineHash } from "./hash";
|
|
@@ -13,8 +10,6 @@ import { Rewriter } from "./rewriter";
|
|
|
13
10
|
|
|
14
11
|
export type Evaluate = (expr: number) => number | null;
|
|
15
12
|
|
|
16
|
-
// instantiation_set: the S_{k,j} sets of the paper, with the generation of each term. The set holds
|
|
17
|
-
// its terms.
|
|
18
13
|
export class InstantiationSet {
|
|
19
14
|
readonly elems: ObjMap<number>;
|
|
20
15
|
readonly inv: ObjMap<number>;
|
|
@@ -36,7 +31,6 @@ export class InstantiationSet {
|
|
|
36
31
|
this.manager.decRef(expr);
|
|
37
32
|
}
|
|
38
33
|
|
|
39
|
-
// ~instantiation_set.
|
|
40
34
|
release() {
|
|
41
35
|
for (const entry of this.elems) this.manager.decRef(entry[0]);
|
|
42
36
|
}
|
|
@@ -62,7 +56,6 @@ export class InstantiationSet {
|
|
|
62
56
|
}
|
|
63
57
|
}
|
|
64
58
|
|
|
65
|
-
// node: a set of argument positions and variables that share an instantiation set.
|
|
66
59
|
export class Node {
|
|
67
60
|
private find: Node | null = null;
|
|
68
61
|
private eqcSize = 1;
|
|
@@ -73,10 +66,7 @@ export class Node {
|
|
|
73
66
|
private elseExpr: number | null = null;
|
|
74
67
|
private proj: number | null = null;
|
|
75
68
|
|
|
76
|
-
constructor(
|
|
77
|
-
readonly id: number,
|
|
78
|
-
readonly sort: number,
|
|
79
|
-
) {}
|
|
69
|
+
constructor(readonly sort: number) {}
|
|
80
70
|
|
|
81
71
|
isRoot() {
|
|
82
72
|
return this.find === null;
|
|
@@ -120,12 +110,10 @@ export class Node {
|
|
|
120
110
|
this.set = new InstantiationSet(manager);
|
|
121
111
|
}
|
|
122
112
|
|
|
123
|
-
// ~node.
|
|
124
113
|
release() {
|
|
125
114
|
this.set?.release();
|
|
126
115
|
}
|
|
127
116
|
|
|
128
|
-
// Only closed terms join the set.
|
|
129
117
|
insert(manager: AstManager, expr: number, generation: number) {
|
|
130
118
|
if (manager.isGround(expr)) this.getRoot().set?.insert(expr, generation);
|
|
131
119
|
}
|
|
@@ -170,31 +158,23 @@ const appendNew = <T>(target: T[], source: T[]) => {
|
|
|
170
158
|
|
|
171
159
|
interface AFINode {
|
|
172
160
|
decl: number;
|
|
173
|
-
index: number;
|
|
174
161
|
node: Node;
|
|
175
162
|
}
|
|
176
163
|
|
|
177
|
-
// The number that keys an argument position of a declaration in m_A_f_is.
|
|
178
164
|
const ARITY_BOUND = 2 ** 20;
|
|
179
165
|
const getAFIKey = (decl: number, index: number) => decl * ARITY_BOUND + index;
|
|
180
166
|
|
|
181
|
-
// auf_solver: the "almost uninterpreted fragment" of the paper.
|
|
182
167
|
export class AufSolver {
|
|
183
168
|
private nodes: Node[] = [];
|
|
184
169
|
private uvars = new Map<string, Node>();
|
|
185
|
-
// m_A_f_is, a table in Z3's slot order, hashed like pair_hash of the declaration and position.
|
|
186
170
|
private aFIs: ObjMap<AFINode>;
|
|
187
171
|
private sort2k = new Map<number, number>();
|
|
188
|
-
// m_ks, the range of m_sort2k.
|
|
189
172
|
private ks: RefVector;
|
|
190
173
|
private model: ProtoModel | null = null;
|
|
191
|
-
// m_eval_cache for each model completion flag, and m_eval_cache_range, which holds the results.
|
|
192
174
|
private evalCache = [new Map<number, number>(), new Map<number, number>()];
|
|
193
175
|
private evalCacheRange: RefVector;
|
|
194
176
|
private rootNodes: Node[] = [];
|
|
195
177
|
private newConstraints: number[] = [];
|
|
196
|
-
// m_rand, seeded with the steps the resource limit counted before the solver was made, which
|
|
197
|
-
// then counts one more.
|
|
198
178
|
private random: RandomGen;
|
|
199
179
|
constructor(
|
|
200
180
|
private manager: AstManager,
|
|
@@ -238,7 +218,7 @@ export class AufSolver {
|
|
|
238
218
|
private mkNode(key: string, map: Map<string, Node>, sort: number) {
|
|
239
219
|
const existing = map.get(key);
|
|
240
220
|
if (existing !== undefined) return existing;
|
|
241
|
-
const node = new Node(
|
|
221
|
+
const node = new Node(sort);
|
|
242
222
|
map.set(key, node);
|
|
243
223
|
this.nodes.push(node);
|
|
244
224
|
return node;
|
|
@@ -253,9 +233,9 @@ export class AufSolver {
|
|
|
253
233
|
const key = getAFIKey(decl, index);
|
|
254
234
|
const existing = this.aFIs.get(key);
|
|
255
235
|
if (existing !== undefined) return existing.node;
|
|
256
|
-
const node = new Node(this.
|
|
236
|
+
const node = new Node(this.manager.funcDecls[decl].domain[index]);
|
|
257
237
|
this.nodes.push(node);
|
|
258
|
-
this.aFIs.set(key, { decl,
|
|
238
|
+
this.aFIs.set(key, { decl, node });
|
|
259
239
|
return node;
|
|
260
240
|
}
|
|
261
241
|
|
|
@@ -267,7 +247,6 @@ export class AufSolver {
|
|
|
267
247
|
for (const node of this.nodes) if (node.isRoot()) node.mkInstantiationSet(this.manager);
|
|
268
248
|
}
|
|
269
249
|
|
|
270
|
-
// cleanup_instantiation_sets: drops the terms that do not evaluate to values.
|
|
271
250
|
private cleanupInstantiationSets() {
|
|
272
251
|
const manager = this.manager;
|
|
273
252
|
for (const node of this.nodes) {
|
|
@@ -315,8 +294,6 @@ export class AufSolver {
|
|
|
315
294
|
return first !== second && manager.isUniqueValue(first) && manager.isUniqueValue(second);
|
|
316
295
|
}
|
|
317
296
|
|
|
318
|
-
// pick_instance_diff_exceptions: the term of least generation whose value differs from every
|
|
319
|
-
// exception.
|
|
320
297
|
private pickInstanceDiffExceptions(node: Node, exceptionValues: number[]) {
|
|
321
298
|
let result: number | null = null;
|
|
322
299
|
let resultGeneration = Number.POSITIVE_INFINITY;
|
|
@@ -332,11 +309,6 @@ export class AufSolver {
|
|
|
332
309
|
return result;
|
|
333
310
|
}
|
|
334
311
|
|
|
335
|
-
// Uninterpreted sorts are not assumed infinite in benchmarks with quantifiers.
|
|
336
|
-
private isInfinite(sort: number) {
|
|
337
|
-
return isArithSort(sort);
|
|
338
|
-
}
|
|
339
|
-
|
|
340
312
|
private getKFor(sort: number) {
|
|
341
313
|
const existing = this.sort2k.get(sort);
|
|
342
314
|
if (existing !== undefined) return existing;
|
|
@@ -363,8 +335,6 @@ export class AufSolver {
|
|
|
363
335
|
if (kValue === null) return false;
|
|
364
336
|
for (const exception of exceptions) {
|
|
365
337
|
const value = this.eval(exception, true);
|
|
366
|
-
// The constraint cannot go into the context while the model is built, so it waits for the
|
|
367
|
-
// next restart.
|
|
368
338
|
if (value !== null && !this.areDistinct(kValue, value))
|
|
369
339
|
this.newConstraints.push(this.manager.mkNot(this.manager.mkEq(k, exception)));
|
|
370
340
|
}
|
|
@@ -381,7 +351,7 @@ export class AufSolver {
|
|
|
381
351
|
node.setElse(picked);
|
|
382
352
|
return;
|
|
383
353
|
}
|
|
384
|
-
if (
|
|
354
|
+
if (isArithSort(node.sort)) {
|
|
385
355
|
const k = this.getKFor(node.sort);
|
|
386
356
|
if (this.assertKDiseqExceptions(k, exceptions)) {
|
|
387
357
|
node.insert(this.manager, k, 0);
|
|
@@ -393,7 +363,6 @@ export class AufSolver {
|
|
|
393
363
|
node.setElse(set.elems.keys().next().value ?? 0);
|
|
394
364
|
}
|
|
395
365
|
|
|
396
|
-
// add_mono_exceptions: e - 1 and e + 1 join the set for each integer exception e.
|
|
397
366
|
private addMonoExceptions(node: Node) {
|
|
398
367
|
if (node.sort !== SORT_INT) return;
|
|
399
368
|
const rewriter = this.rewriter;
|
|
@@ -462,7 +431,6 @@ export class AufSolver {
|
|
|
462
431
|
node.setProj(decl);
|
|
463
432
|
}
|
|
464
433
|
|
|
465
|
-
// collect_partial_funcs: a func_decl_set, in Z3's slot order.
|
|
466
434
|
private collectPartialFuncs() {
|
|
467
435
|
const manager = this.manager;
|
|
468
436
|
const model = this.getModel();
|
|
@@ -480,7 +448,6 @@ export class AufSolver {
|
|
|
480
448
|
return result;
|
|
481
449
|
}
|
|
482
450
|
|
|
483
|
-
// mk_sorts_finite: every uninterpreted sort gets a finite universe.
|
|
484
451
|
private mkSortsFinite() {
|
|
485
452
|
const model = this.getModel();
|
|
486
453
|
for (const node of this.rootNodes)
|
|
@@ -1,16 +1,9 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_case_split_queue.cpp, src/util/heap.h), MIT license, see
|
|
2
|
-
// z3-license.txt. Z3's default CS_ACTIVITY_DELAY_NEW queue: Boolean variables ordered by activity,
|
|
3
|
-
// where variables created during the search wait in a delayed queue until the main one runs dry.
|
|
4
|
-
// Without the delay, it is the CS_ACTIVITY queue of the model checker's auxiliary context.
|
|
1
|
+
// Ported from Z3 (src/smt/smt_case_split_queue.cpp, src/util/heap.h), MIT license, see z3-license.txt.
|
|
5
2
|
|
|
6
3
|
import { BoolVar, toBoolVar } from "./literal";
|
|
7
4
|
|
|
8
|
-
// heap<bool_var_act_lt>: a binary min-heap over activities negated, so the most active is first.
|
|
9
5
|
class ActivityHeap {
|
|
10
|
-
// The heap is 1-based, so the first slot is unused.
|
|
11
6
|
private values: BoolVar[] = [toBoolVar(-1)];
|
|
12
|
-
// The position of each variable, or 0. A typed array keeps the loads of variables that were never
|
|
13
|
-
// inserted in bounds.
|
|
14
7
|
private indices = new Int32Array(1024);
|
|
15
8
|
|
|
16
9
|
constructor(private activity: number[]) {}
|
|
@@ -157,7 +150,6 @@ export class CaseSplitQueue {
|
|
|
157
150
|
if (!this.queue.contains(boolVar)) this.queue.insert(boolVar);
|
|
158
151
|
}
|
|
159
152
|
|
|
160
|
-
// Returns the next variable to split on, or undefined when every variable is assigned.
|
|
161
153
|
nextCaseSplit() {
|
|
162
154
|
const context = this.context;
|
|
163
155
|
if (context.getRandomValue() < Math.trunc(RANDOM_VAR_FREQ * RANDOM_MAX_VALUE)) {
|
|
@@ -1,9 +1,6 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_cg_table.h, src/smt/smt_cg_table.cpp), MIT license, see
|
|
2
|
-
// z3-license.txt. The congruence table maps a declaration and the roots of its arguments to the
|
|
3
|
-
// congruence root, so f(a) and f(b) meet when a and b are merged. Equalities are commutative.
|
|
1
|
+
// Ported from Z3 (src/smt/smt_cg_table.h, src/smt/smt_cg_table.cpp), MIT license, see z3-license.txt.
|
|
4
2
|
import { CONGRUENCE_JUSTIFICATIONS, type Enode } from "./enode";
|
|
5
3
|
|
|
6
|
-
// The hash of an equality between the classes of first and second, in either order.
|
|
7
4
|
const getEqHash = (decl: number, first: number, second: number) =>
|
|
8
5
|
first < second
|
|
9
6
|
? (Math.imul(Math.imul(decl, 0x9e3779b1) + first, 0x85ebca6b) + second) | 0
|
|
@@ -25,7 +22,6 @@ const getNodeHash = (node: Enode) => {
|
|
|
25
22
|
return hash;
|
|
26
23
|
};
|
|
27
24
|
|
|
28
|
-
// Whether node is decl applied to nodes equal to first and second, in either order for an equality.
|
|
29
25
|
const isPairCongruentTo = (node: Enode, first: Enode, second: Enode, isEq: boolean) => {
|
|
30
26
|
const nodeFirst = node.getArg(0).root;
|
|
31
27
|
const nodeSecond = node.getArg(1).root;
|
|
@@ -43,8 +39,6 @@ const isCongruentTo = (node: Enode, decl: number, args: Enode[], isEq: boolean)
|
|
|
43
39
|
return true;
|
|
44
40
|
};
|
|
45
41
|
|
|
46
|
-
// congruent: whether two nodes apply one declaration to equal arguments. Only equalities are
|
|
47
|
-
// commutative.
|
|
48
42
|
export const isCongruent = (first: Enode, second: Enode) => {
|
|
49
43
|
if (first.decl !== second.decl || first.numArgs !== second.numArgs) return false;
|
|
50
44
|
if (first.numArgs === 2)
|
|
@@ -54,7 +48,6 @@ export const isCongruent = (first: Enode, second: Enode) => {
|
|
|
54
48
|
return true;
|
|
55
49
|
};
|
|
56
50
|
|
|
57
|
-
// The justification of a node's equality with the congruent node that the table returned for it.
|
|
58
51
|
export const getCongruenceJustification = (node: Enode, congruent: Enode) =>
|
|
59
52
|
CONGRUENCE_JUSTIFICATIONS[node.isEq && congruent.getArg(0).root !== node.getArg(0).root ? 1 : 0];
|
|
60
53
|
|
|
@@ -62,8 +55,6 @@ const EMPTY = 0;
|
|
|
62
55
|
const FULL = 1;
|
|
63
56
|
const DELETED = 2;
|
|
64
57
|
|
|
65
|
-
// Open addressing with linear probing. An erased node leaves a deleted slot, which probes pass over,
|
|
66
|
-
// until the table is rebuilt.
|
|
67
58
|
export class CgTable {
|
|
68
59
|
private nodes = Array<Enode | null>(1024).fill(null);
|
|
69
60
|
private hashes = new Int32Array(1024);
|
|
@@ -101,7 +92,6 @@ export class CgTable {
|
|
|
101
92
|
return undefined;
|
|
102
93
|
}
|
|
103
94
|
|
|
104
|
-
// Returns the congruence root for node, which is node itself when it is new.
|
|
105
95
|
insert(node: Enode) {
|
|
106
96
|
const hash = getNodeHash(node);
|
|
107
97
|
const existing = this.findNode(node, hash);
|
|
@@ -122,7 +112,6 @@ export class CgTable {
|
|
|
122
112
|
this.numFull++;
|
|
123
113
|
}
|
|
124
114
|
|
|
125
|
-
// Drops the deleted slots, and doubles the table when it is more than a quarter full.
|
|
126
115
|
private rebuild() {
|
|
127
116
|
const nodes = this.nodes;
|
|
128
117
|
const hashes = this.hashes;
|
|
@@ -143,12 +132,10 @@ export class CgTable {
|
|
|
143
132
|
}
|
|
144
133
|
}
|
|
145
134
|
|
|
146
|
-
// get_enode_eq_to: the congruence root of decl applied to nodes equal to args, if any.
|
|
147
135
|
findFor(decl: number, args: Enode[], isEq: boolean) {
|
|
148
136
|
return this.find(decl, args, isEq, getHash(decl, args, isEq));
|
|
149
137
|
}
|
|
150
138
|
|
|
151
|
-
// The congruence root of a node congruent to node.
|
|
152
139
|
findCongruent(node: Enode) {
|
|
153
140
|
return this.findNode(node, getNodeHash(node));
|
|
154
141
|
}
|
|
@@ -168,8 +155,4 @@ export class CgTable {
|
|
|
168
155
|
this.numFull--;
|
|
169
156
|
this.numDeleted++;
|
|
170
157
|
}
|
|
171
|
-
|
|
172
|
-
contains(node: Enode) {
|
|
173
|
-
return this.getSlot(node) !== -1;
|
|
174
|
-
}
|
|
175
158
|
}
|
|
@@ -1,6 +1,4 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_clause.h, src/smt/smt_b_justification.h,
|
|
2
|
-
// src/util/small_object_allocator.cpp), MIT license, see z3-license.txt. Disjunctions of literals,
|
|
3
|
-
// and the reasons a literal is assigned.
|
|
1
|
+
// Ported from Z3 (src/smt/smt_clause.h, src/smt/smt_b_justification.h, src/util/small_object_allocator.cpp), MIT license, see z3-license.txt.
|
|
4
2
|
import { SmtInvariantError } from "../../../errors";
|
|
5
3
|
import type { Justification } from "./enode";
|
|
6
4
|
import type { Literal } from "./literal";
|
|
@@ -11,16 +9,12 @@ export const CLS_LEARNED = 1;
|
|
|
11
9
|
export const CLS_TH_AXIOM = 2;
|
|
12
10
|
export const CLS_TH_LEMMA = 3;
|
|
13
11
|
|
|
14
|
-
// b_justification(l) of BIN_CLAUSE kind: a binary clause propagated because the literal l became true.
|
|
15
12
|
export class BinJustification {
|
|
16
13
|
constructor(readonly literal: Literal) {}
|
|
17
14
|
}
|
|
18
15
|
|
|
19
|
-
// b_justification: a clause, a binary clause, a theory justification, an axiom, or a decision (null).
|
|
20
16
|
export type BJustification = number | BinJustification | Justification | "axiom" | null;
|
|
21
17
|
|
|
22
|
-
// The second header word packs Z3's bit fields: m_capacity:24, m_kind:2, m_reinit,
|
|
23
|
-
// m_reinternalize_atoms, m_has_atoms, m_has_del_eh, m_has_justification and m_deleted.
|
|
24
18
|
const CAPACITY_MASK = 0xffffff;
|
|
25
19
|
const KIND_SHIFT = 24;
|
|
26
20
|
const IS_REINIT = 1 << 26;
|
|
@@ -29,30 +23,18 @@ const HAS_ATOMS = 1 << 28;
|
|
|
29
23
|
const HAS_DEL_EH = 1 << 29;
|
|
30
24
|
const HAS_JUSTIFICATION = 1 << 30;
|
|
31
25
|
const IS_DELETED = 1 << 31;
|
|
32
|
-
// The words before the literals: m_num_literals and the bit fields.
|
|
33
26
|
export const HEADER_SIZE = 2;
|
|
34
|
-
// An atom word of a clause whose atoms were released.
|
|
35
27
|
const NO_ATOM = -1;
|
|
36
28
|
|
|
37
|
-
// The clauses live in one Int32Array, and a clause is the offset of its block, as a clause is the
|
|
38
|
-
// address of its memory in Z3. A block holds the header, the literals, then the activity of a lemma,
|
|
39
|
-
// the slots of the deletion handler and the justification, and the atoms with their signs, each
|
|
40
|
-
// present only when used. Like small_object_allocator, a freed block goes on the free list of its size
|
|
41
|
-
// for the next clause of that size, and the array never shrinks. A freed block keeps the next free
|
|
42
|
-
// block in its first word and 0 in its second, which no clause has.
|
|
43
29
|
export class ClauseStore {
|
|
44
|
-
// Literal i of clause c is data[c + 2 + i]. Making a clause can replace the array, so a loop that
|
|
45
|
-
// makes clauses reads it again.
|
|
46
30
|
data = new Int32Array(1 << 16);
|
|
47
31
|
private top = 0;
|
|
48
32
|
private freeLists: (number | undefined)[] = [];
|
|
49
|
-
// The deletion handlers and justifications, which a block refers to by slot.
|
|
50
33
|
private delEhs: ((() => void) | null)[] = [];
|
|
51
34
|
private freeDelEhSlots: number[] = [];
|
|
52
35
|
private justifications: (Justification | null)[] = [];
|
|
53
36
|
private freeJustificationSlots: number[] = [];
|
|
54
37
|
|
|
55
|
-
// get_obj_size, in words.
|
|
56
38
|
private getSize(flags: number) {
|
|
57
39
|
const capacity = flags & CAPACITY_MASK;
|
|
58
40
|
return (
|
|
@@ -81,7 +63,6 @@ export class ClauseStore {
|
|
|
81
63
|
return block;
|
|
82
64
|
}
|
|
83
65
|
|
|
84
|
-
// clause::mk. The atoms are the atom of each literal, which the clause keeps with the literal's sign.
|
|
85
66
|
mk(
|
|
86
67
|
literals: Literal[],
|
|
87
68
|
kind: number,
|
|
@@ -119,7 +100,6 @@ export class ClauseStore {
|
|
|
119
100
|
return slot;
|
|
120
101
|
}
|
|
121
102
|
|
|
122
|
-
// deallocate: the block goes on its free list. The atoms must be released first.
|
|
123
103
|
free(clause: Clause) {
|
|
124
104
|
const data = this.data;
|
|
125
105
|
const flags = data[clause + 1];
|
|
@@ -140,12 +120,10 @@ export class ClauseStore {
|
|
|
140
120
|
setAt(this.freeLists, size, clause);
|
|
141
121
|
}
|
|
142
122
|
|
|
143
|
-
// The first word after the literals, where the activity of a lemma is.
|
|
144
123
|
private getExtra(clause: Clause) {
|
|
145
124
|
return clause + HEADER_SIZE + (this.data[clause + 1] & CAPACITY_MASK);
|
|
146
125
|
}
|
|
147
126
|
|
|
148
|
-
// A clause that was freed is not one any more, which the slower paths check.
|
|
149
127
|
checkLive(clause: Clause) {
|
|
150
128
|
if ((this.data[clause + 1] & CAPACITY_MASK) === 0)
|
|
151
129
|
throw new SmtInvariantError("the clause was freed");
|
|
@@ -246,7 +224,6 @@ export class ClauseStore {
|
|
|
246
224
|
return this.getSlotAddress(clause, HAS_JUSTIFICATION) + (flags & HAS_JUSTIFICATION ? 1 : 0);
|
|
247
225
|
}
|
|
248
226
|
|
|
249
|
-
// The atoms the clause still holds, or none once they are released.
|
|
250
227
|
getAtoms(clause: Clause) {
|
|
251
228
|
const address = this.getAtomsAddress(clause);
|
|
252
229
|
if (address === -1 || this.data[address] === NO_ATOM) return [];
|
|
@@ -256,12 +233,10 @@ export class ClauseStore {
|
|
|
256
233
|
return atoms;
|
|
257
234
|
}
|
|
258
235
|
|
|
259
|
-
// The sign of the literal of atom i, as the clause was made.
|
|
260
236
|
getAtomSign(clause: Clause, index: number) {
|
|
261
237
|
return (this.data[this.getAtomsAddress(clause) + index] & 1) === 1;
|
|
262
238
|
}
|
|
263
239
|
|
|
264
|
-
// Marks the atoms released, after their references are dropped.
|
|
265
240
|
clearAtoms(clause: Clause) {
|
|
266
241
|
const address = this.getAtomsAddress(clause);
|
|
267
242
|
if (address === -1) return;
|
|
@@ -270,7 +245,6 @@ export class ClauseStore {
|
|
|
270
245
|
}
|
|
271
246
|
}
|
|
272
247
|
|
|
273
|
-
// A clause is the offset of its block in the ClauseStore.
|
|
274
248
|
export type Clause = number;
|
|
275
249
|
|
|
276
250
|
const isLemmaKind = (kind: number) => kind === CLS_LEARNED || kind === CLS_TH_LEMMA;
|
|
@@ -1,6 +1,4 @@
|
|
|
1
1
|
// Ported from Z3 (src/smt/smt_conflict_resolution.cpp), MIT license, see z3-license.txt.
|
|
2
|
-
// First-UIP conflict resolution with lemma minimization. Equalities in a conflict are explained
|
|
3
|
-
// by walking the transitivity branches of the E-graph down to literals.
|
|
4
2
|
import { BinJustification, type BJustification } from "./clause";
|
|
5
3
|
import type { Context } from "./context";
|
|
6
4
|
import { Enode, EqJustification, Justification } from "./enode";
|
|
@@ -15,14 +13,11 @@ export class ConflictResolution {
|
|
|
15
13
|
private todoEqs: Enode[] = [];
|
|
16
14
|
private processedEqs = new Set<string>();
|
|
17
15
|
lemma: Literal[] = [];
|
|
18
|
-
// m_lemma_atoms: the atoms of the lemma, which it holds until the lemma is a clause.
|
|
19
16
|
readonly lemmaAtoms: RefVector;
|
|
20
17
|
private conflictLevel = 0;
|
|
21
18
|
newScopeLevel = 0;
|
|
22
19
|
lemmaIscopeLevel = 0;
|
|
23
20
|
private unmark: BoolVar[] = [];
|
|
24
|
-
// m_lvl_set: a level_approx_set, whose bit level mod 32 stands for each level of the lemma, so
|
|
25
|
-
// other levels can pass for them.
|
|
26
21
|
private levelSet = 0;
|
|
27
22
|
private minimizationStack: BoolVar[] = [];
|
|
28
23
|
|
|
@@ -34,8 +29,6 @@ export class ConflictResolution {
|
|
|
34
29
|
this.antecedents.push(literal);
|
|
35
30
|
}
|
|
36
31
|
|
|
37
|
-
// mark_eq: the pair starts with the node whose owner has the smaller id, which fixes the order in
|
|
38
|
-
// which eq2literals walks the two branches.
|
|
39
32
|
markEq(first: Enode, second: Enode) {
|
|
40
33
|
if (first === second) return;
|
|
41
34
|
const ids = this.context.manager.ids;
|
|
@@ -192,7 +185,6 @@ export class ConflictResolution {
|
|
|
192
185
|
this.processAntecedent(literal, marks);
|
|
193
186
|
}
|
|
194
187
|
|
|
195
|
-
// Returns false when the conflict is at the search level, so the problem is unsat.
|
|
196
188
|
resolve(conflict: BJustification, notLiteral: Literal | null) {
|
|
197
189
|
const context = this.context;
|
|
198
190
|
this.lemma = [];
|
|
@@ -204,7 +196,6 @@ export class ConflictResolution {
|
|
|
204
196
|
const assigned = context.assignedLiterals;
|
|
205
197
|
let index = assigned.length - 1;
|
|
206
198
|
while (index > 0 && context.getAssignLevel(assigned[index]) > this.conflictLevel) index--;
|
|
207
|
-
// The first slot holds the negated first unique implication point, found below.
|
|
208
199
|
this.lemma.push(context.falseLiteral);
|
|
209
200
|
this.lemmaAtoms.push(-1);
|
|
210
201
|
const marks = { count: 0 };
|