tla-ts 0.0.4-dev.6dec595 → 0.0.4-dev.7b5087a
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 +27 -141
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +35 -1
- package/dist/index.d.ts +35 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +996 -0
- package/dist/prove.js +996 -0
- package/dist/run-cli.cjs +517 -47
- package/dist/run-cli.js +517 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/errors.ts +86 -0
- package/src/evaluate.ts +28 -7
- package/src/index.ts +10 -0
- package/src/{obligation-action.ts → obligations/action.ts} +258 -37
- package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
- package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
- package/src/{obligation-format.ts → obligations/format.ts} +6 -5
- package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
- package/src/{obligations.ts → obligations/index.ts} +28 -12
- package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
- package/src/{obligation-module.ts → obligations/module.ts} +46 -20
- package/src/obligations/pickle.ts +100 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +9 -63
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
- package/src/{obligation-source.ts → obligations/source.ts} +91 -35
- package/src/obligations/temporal.ts +319 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
- package/src/ocaml-marshal.ts +172 -0
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +100 -0
- package/src/prove/deciders.ts +33 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +512 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +547 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +441 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +363 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +402 -0
- package/src/prove/isabelle/pure/name.ts +110 -0
- package/src/prove/isabelle/pure/net.ts +262 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +650 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +156 -0
- package/src/prove/isabelle/pure/simplifier.ts +112 -0
- package/src/prove/isabelle/pure/table.ts +208 -0
- package/src/prove/isabelle/pure/tactic.ts +276 -0
- package/src/prove/isabelle/pure/tactical.ts +347 -0
- package/src/prove/isabelle/pure/term-ord.ts +159 -0
- package/src/prove/isabelle/pure/term.ts +808 -0
- package/src/prove/isabelle/pure/thm.ts +806 -0
- package/src/prove/isabelle/pure/type.ts +133 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +520 -0
- package/src/prove/prep/defs.ts +33 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +552 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +27 -0
- package/src/prove/prove.ts +528 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +256 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +210 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +665 -0
- package/src/prove/smt/encode.ts +169 -0
- package/src/prove/smt/extensionality.ts +63 -0
- package/src/prove/smt/flatten.ts +127 -0
- package/src/prove/smt/format.ts +143 -0
- package/src/prove/smt/instances.ts +182 -0
- package/src/prove/smt/rewrite.ts +784 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +147 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +97 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +19 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +444 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +181 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/run-cli.ts +338 -52
- package/src/tlapm-cache.ts +250 -0
- package/src/values.ts +8 -3
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
|
@@ -0,0 +1,250 @@
|
|
|
1
|
+
// tlapm's fingerprints file, ported from src/backend/fpfile.ml: a Marshal'd FP13 table from each
|
|
2
|
+
// obligation's fingerprint to the result each prover last concluded, which tla-ts and tlapm share.
|
|
3
|
+
|
|
4
|
+
import {
|
|
5
|
+
cpSync,
|
|
6
|
+
existsSync,
|
|
7
|
+
mkdirSync,
|
|
8
|
+
readdirSync,
|
|
9
|
+
readFileSync,
|
|
10
|
+
renameSync,
|
|
11
|
+
rmSync,
|
|
12
|
+
statSync,
|
|
13
|
+
writeFileSync,
|
|
14
|
+
} from "node:fs";
|
|
15
|
+
import { basename, join } from "node:path";
|
|
16
|
+
import { version } from "../package.json";
|
|
17
|
+
import { TlaProofError } from "./errors";
|
|
18
|
+
import { block, isBlock, readMarshaled, writeMarshaled, type OcamlValue } from "./ocaml-marshal";
|
|
19
|
+
import type { ProofAttempt } from "./prove/prove";
|
|
20
|
+
|
|
21
|
+
// Each fingerprint's record of results: one optional result per prover, in V13.str's order.
|
|
22
|
+
export type FingerprintTable = Map<string, OcamlValue[]>;
|
|
23
|
+
|
|
24
|
+
const MAGIC_NUMBER = 20210223;
|
|
25
|
+
|
|
26
|
+
const RECORD_SIZE = 23;
|
|
27
|
+
|
|
28
|
+
// The record's field and the V13.meth constructor of each of tla-ts's provers.
|
|
29
|
+
const PROVERS: Record<string, { field: number; tag: number }> = {
|
|
30
|
+
zenon: { field: 1, tag: 1 },
|
|
31
|
+
isabelle: { field: 2, tag: 0 },
|
|
32
|
+
smt: { field: 10, tag: 8 },
|
|
33
|
+
z3: { field: 11, tag: 9 },
|
|
34
|
+
ls4: { field: 17, tag: 16 },
|
|
35
|
+
};
|
|
36
|
+
|
|
37
|
+
const FAIL_METHOD = 5;
|
|
38
|
+
|
|
39
|
+
const REASONS = ["false", "timeout"];
|
|
40
|
+
|
|
41
|
+
// tlapm stores its own version and those of Zenon and Isabelle with each result, and --safefp
|
|
42
|
+
// trusts a Zenon or Isabelle result only from the same versions. tla-ts's provers are its own.
|
|
43
|
+
const VERSION = `tla-ts ${version}`;
|
|
44
|
+
|
|
45
|
+
// The index in a result of the version --safefp checks, by the record's field.
|
|
46
|
+
const CHECKED_VERSIONS = new Map([
|
|
47
|
+
[PROVERS.zenon.field, 3],
|
|
48
|
+
[PROVERS.isabelle.field, 4],
|
|
49
|
+
]);
|
|
50
|
+
|
|
51
|
+
const HISTORY_SIZE = 10;
|
|
52
|
+
|
|
53
|
+
const getField = (value: OcamlValue | undefined, index: number) =>
|
|
54
|
+
value !== undefined && isBlock(value) ? value.fields[index] : undefined;
|
|
55
|
+
|
|
56
|
+
const getFloat = (value: OcamlValue | undefined) =>
|
|
57
|
+
value !== undefined && typeof value === "object" && "float" in value ? value.float : Infinity;
|
|
58
|
+
|
|
59
|
+
// Hashtbl.hash on a string with the seed 0: caml_hash's MurmurHash3 mixing of the bytes.
|
|
60
|
+
const hashKey = (key: string) => {
|
|
61
|
+
const bytes = new TextEncoder().encode(key);
|
|
62
|
+
const rotate = (value: number, shift: number) => (value << shift) | (value >>> (32 - shift));
|
|
63
|
+
const mixed = Array.from(
|
|
64
|
+
{ length: Math.ceil(bytes.length / 4) },
|
|
65
|
+
(_, index) =>
|
|
66
|
+
bytes[index * 4] |
|
|
67
|
+
(bytes[index * 4 + 1] << 8) |
|
|
68
|
+
(bytes[index * 4 + 2] << 16) |
|
|
69
|
+
(bytes[index * 4 + 3] << 24),
|
|
70
|
+
).reduce((hash, word) => {
|
|
71
|
+
const data = Math.imul(rotate(Math.imul(word, 0xcc9e2d51), 15), 0x1b873593);
|
|
72
|
+
return (Math.imul(rotate(hash ^ data, 13), 5) + 0xe6546b64) | 0;
|
|
73
|
+
}, 0);
|
|
74
|
+
const first = Math.imul(mixed ^ bytes.length ^ ((mixed ^ bytes.length) >>> 16), 0x85ebca6b);
|
|
75
|
+
const second = Math.imul(first ^ (first >>> 13), 0xc2b2ae35);
|
|
76
|
+
return (second ^ (second >>> 16)) & 0x3fffffff;
|
|
77
|
+
};
|
|
78
|
+
|
|
79
|
+
// The stored result each loaded result came from, which keeps its date and versions, and the
|
|
80
|
+
// record each loaded fingerprint's results came from, which keeps its other provers' results.
|
|
81
|
+
const storedResults = new WeakMap<ProofAttempt, OcamlValue>();
|
|
82
|
+
const storedRecords = new WeakMap<Map<string, ProofAttempt>, OcamlValue[]>();
|
|
83
|
+
|
|
84
|
+
const readBucket = (entry: OcamlValue | undefined): [OcamlValue, OcamlValue][] =>
|
|
85
|
+
entry !== undefined && isBlock(entry)
|
|
86
|
+
? [[entry.fields[0], entry.fields[1]], ...readBucket(entry.fields[2])]
|
|
87
|
+
: [];
|
|
88
|
+
|
|
89
|
+
// Fpfile.load_fingerprints: replaces the table with the file's. Each bucket lists the latest
|
|
90
|
+
// fingerprint first.
|
|
91
|
+
export const loadFingerprints = (table: FingerprintTable, path: string, isSafe: boolean) => {
|
|
92
|
+
const bytes = readFileSync(path);
|
|
93
|
+
const magic = readMarshaled(bytes, 0);
|
|
94
|
+
const fp = readMarshaled(bytes, magic.next).value;
|
|
95
|
+
if (magic.value !== MAGIC_NUMBER || !isBlock(fp) || fp.tag !== 0)
|
|
96
|
+
throw new TlaProofError("corrupted fingerprint file");
|
|
97
|
+
const buckets = getField(getField(fp, 0), 1);
|
|
98
|
+
const isTrusted = (sti: OcamlValue, field: number) => {
|
|
99
|
+
const index = CHECKED_VERSIONS.get(field);
|
|
100
|
+
return !isSafe || index === undefined || getField(getField(sti, 0), index) === VERSION;
|
|
101
|
+
};
|
|
102
|
+
table.clear();
|
|
103
|
+
(buckets !== undefined && isBlock(buckets) ? buckets.fields : [])
|
|
104
|
+
.flatMap((bucket) => readBucket(bucket).toReversed())
|
|
105
|
+
.forEach(([key, record]) => {
|
|
106
|
+
if (typeof key !== "string" || !isBlock(record))
|
|
107
|
+
throw new TlaProofError("corrupted fingerprint file");
|
|
108
|
+
table.set(
|
|
109
|
+
key,
|
|
110
|
+
record.fields.map((sti, field) => (isTrusted(sti, field) ? sti : 0)),
|
|
111
|
+
);
|
|
112
|
+
});
|
|
113
|
+
};
|
|
114
|
+
|
|
115
|
+
const decodeResult = (prover: string, sti: OcamlValue | undefined): ProofAttempt | undefined => {
|
|
116
|
+
const status = getField(sti, 0);
|
|
117
|
+
const outcome = getField(status, 0);
|
|
118
|
+
const argument = getField(getField(status, 1), 0);
|
|
119
|
+
if (outcome === undefined || outcome === 1) return undefined;
|
|
120
|
+
const seconds = getFloat(getField(prover === "isabelle" ? getField(argument, 0) : argument, 0));
|
|
121
|
+
const tactic = prover === "isabelle" ? getField(argument, 1) : undefined;
|
|
122
|
+
const reason = getField(getField(outcome, 0), 0);
|
|
123
|
+
return {
|
|
124
|
+
method: {
|
|
125
|
+
prover,
|
|
126
|
+
timeLimitMs: seconds * 1000,
|
|
127
|
+
...(typeof tactic === "string" && { tactic }),
|
|
128
|
+
},
|
|
129
|
+
isProved: outcome === 0,
|
|
130
|
+
isReused: false,
|
|
131
|
+
...(reason !== undefined && {
|
|
132
|
+
reason: typeof reason === "number" ? REASONS[reason] : String(getField(reason, 0)),
|
|
133
|
+
}),
|
|
134
|
+
};
|
|
135
|
+
};
|
|
136
|
+
|
|
137
|
+
// Fpfile.query: what each of tla-ts's provers concluded for each fingerprint.
|
|
138
|
+
export const getKnownResults = (table: FingerprintTable) =>
|
|
139
|
+
new Map(
|
|
140
|
+
[...table].map(([fingerprint, record]) => {
|
|
141
|
+
const results = new Map(
|
|
142
|
+
Object.entries(PROVERS).flatMap(([prover, known]) => {
|
|
143
|
+
const result = decodeResult(prover, getField(record[known.field], 0));
|
|
144
|
+
if (!result) return [];
|
|
145
|
+
storedResults.set(result, record[known.field]);
|
|
146
|
+
return [[prover, result]];
|
|
147
|
+
}),
|
|
148
|
+
);
|
|
149
|
+
storedRecords.set(results, record);
|
|
150
|
+
return [fingerprint, results];
|
|
151
|
+
}),
|
|
152
|
+
);
|
|
153
|
+
|
|
154
|
+
// Fpfile.fp_writes: a result with the local date, in tlapm's month-1 form, and the versions.
|
|
155
|
+
const encodeResult = (attempt: ProofAttempt) => {
|
|
156
|
+
const now = new Date();
|
|
157
|
+
const method = attempt.method;
|
|
158
|
+
const timeout = { float: method.rlimit ?? method.timeLimitMs / 1000 };
|
|
159
|
+
const argument =
|
|
160
|
+
method.prover === "zenon"
|
|
161
|
+
? block(0, timeout, FAIL_METHOD)
|
|
162
|
+
: method.prover === "isabelle"
|
|
163
|
+
? block(0, block(0, timeout), method.tactic ?? "auto")
|
|
164
|
+
: block(0, timeout);
|
|
165
|
+
const reasonIndex = REASONS.indexOf(attempt.reason ?? "");
|
|
166
|
+
const reason =
|
|
167
|
+
attempt.reason === undefined
|
|
168
|
+
? 0
|
|
169
|
+
: block(0, reasonIndex === -1 ? block(0, attempt.reason) : reasonIndex);
|
|
170
|
+
return block(
|
|
171
|
+
0,
|
|
172
|
+
block(
|
|
173
|
+
0,
|
|
174
|
+
block(
|
|
175
|
+
0,
|
|
176
|
+
attempt.isProved ? 0 : block(0, reason),
|
|
177
|
+
block(PROVERS[method.prover].tag, argument),
|
|
178
|
+
),
|
|
179
|
+
block(
|
|
180
|
+
0,
|
|
181
|
+
now.getFullYear(),
|
|
182
|
+
now.getMonth(),
|
|
183
|
+
now.getDate(),
|
|
184
|
+
now.getHours(),
|
|
185
|
+
now.getMinutes(),
|
|
186
|
+
now.getSeconds(),
|
|
187
|
+
),
|
|
188
|
+
VERSION,
|
|
189
|
+
VERSION,
|
|
190
|
+
VERSION,
|
|
191
|
+
),
|
|
192
|
+
);
|
|
193
|
+
};
|
|
194
|
+
|
|
195
|
+
// Fpfile.fp_writes and add_to_table: the table of what the run concluded. A fingerprint loaded
|
|
196
|
+
// from the file keeps what other provers concluded, unless --nofp removed it.
|
|
197
|
+
export const updateFingerprints = (
|
|
198
|
+
table: FingerprintTable,
|
|
199
|
+
results: Map<string, Map<string, ProofAttempt>>,
|
|
200
|
+
) => {
|
|
201
|
+
table.clear();
|
|
202
|
+
results.forEach((attempts, fingerprint) => {
|
|
203
|
+
const record = [...(storedRecords.get(attempts) ?? Array<OcamlValue>(RECORD_SIZE).fill(0))];
|
|
204
|
+
attempts.forEach((attempt, prover) => {
|
|
205
|
+
record[PROVERS[prover].field] = storedResults.get(attempt) ?? encodeResult(attempt);
|
|
206
|
+
});
|
|
207
|
+
table.set(fingerprint, record);
|
|
208
|
+
});
|
|
209
|
+
};
|
|
210
|
+
|
|
211
|
+
const encodeTable = (table: FingerprintTable) => {
|
|
212
|
+
const length = 2 ** Math.max(9, Math.ceil(Math.log2(table.size / 2)));
|
|
213
|
+
const buckets: OcamlValue[] = Array.from({ length }, () => 0);
|
|
214
|
+
table.forEach((record, fingerprint) => {
|
|
215
|
+
const index = hashKey(fingerprint) & (length - 1);
|
|
216
|
+
buckets[index] = block(0, fingerprint, block(0, ...record), buckets[index]);
|
|
217
|
+
});
|
|
218
|
+
return block(0, block(0, table.size, block(0, ...buckets), 0, 512));
|
|
219
|
+
};
|
|
220
|
+
|
|
221
|
+
const pad = (value: number) => String(value).padStart(2, "0");
|
|
222
|
+
|
|
223
|
+
// Fpfile.fp_init: copies the fingerprints file and the modules' sources in the current directory
|
|
224
|
+
// into a dated directory of its history, keeping the 10 latest.
|
|
225
|
+
export const saveHistory = (path: string, sources: string[]) => {
|
|
226
|
+
const now = new Date();
|
|
227
|
+
const history = `${path}.history`;
|
|
228
|
+
const directory = join(
|
|
229
|
+
history,
|
|
230
|
+
`${now.getFullYear()}-${pad(now.getMonth() + 1)}-${pad(now.getDate())}_${pad(now.getHours())}_${pad(now.getMinutes())}_${pad(now.getSeconds())}`,
|
|
231
|
+
);
|
|
232
|
+
mkdirSync(directory, { recursive: true });
|
|
233
|
+
[path, ...sources]
|
|
234
|
+
.filter((file) => existsSync(file))
|
|
235
|
+
.forEach((file) => cpSync(file, join(directory, basename(file)), { preserveTimestamps: true }));
|
|
236
|
+
readdirSync(history)
|
|
237
|
+
.map((name) => join(history, name))
|
|
238
|
+
.sort((left, right) => statSync(right).mtimeMs - statSync(left).mtimeMs)
|
|
239
|
+
.slice(HISTORY_SIZE)
|
|
240
|
+
.forEach((old) => rmSync(old, { recursive: true, force: true }));
|
|
241
|
+
};
|
|
242
|
+
|
|
243
|
+
// Fpfile.fp_close_and_consolidate: writes the table beside the file, then over it.
|
|
244
|
+
export const saveFingerprints = (table: FingerprintTable, path: string) => {
|
|
245
|
+
writeFileSync(
|
|
246
|
+
`${path}.tmp`,
|
|
247
|
+
Buffer.concat([writeMarshaled(MAGIC_NUMBER), writeMarshaled(encodeTable(table))]),
|
|
248
|
+
);
|
|
249
|
+
renameSync(`${path}.tmp`, path);
|
|
250
|
+
};
|
package/src/values.ts
CHANGED
|
@@ -625,9 +625,14 @@ export const valuesEqual = (left: Value, right: Value): boolean => {
|
|
|
625
625
|
// TLC prints and words errors about an equal function by its Java class, so a value can stand for
|
|
626
626
|
// another in a state only if each function in it has the same class.
|
|
627
627
|
const createSameValueCheck = (isClassSensitive: boolean) => {
|
|
628
|
-
const areSameValues = (left: Value[], right: Value[]) =>
|
|
629
|
-
left === right
|
|
630
|
-
(left.length
|
|
628
|
+
const areSameValues = (left: Value[], right: Value[]) => {
|
|
629
|
+
if (left === right) return true;
|
|
630
|
+
if (left.length !== right.length) return false;
|
|
631
|
+
for (let index = 0; index < left.length; index++) {
|
|
632
|
+
if (!isSame(left[index], right[index])) return false;
|
|
633
|
+
}
|
|
634
|
+
return true;
|
|
635
|
+
};
|
|
631
636
|
const isSame = (left: Value, right: Value): boolean => {
|
|
632
637
|
if (left === right) return true;
|
|
633
638
|
if (typeof left !== "object" || typeof right !== "object") return false;
|
package/src/worker.ts
ADDED
|
@@ -0,0 +1,65 @@
|
|
|
1
|
+
// Worker threads as Web Workers, or as Node's worker_threads where there are none.
|
|
2
|
+
|
|
3
|
+
const WORKER_THREADS_MODULE = "node:worker_threads";
|
|
4
|
+
|
|
5
|
+
export interface Port {
|
|
6
|
+
postMessage: (message: unknown, transfer?: unknown[]) => void;
|
|
7
|
+
addEventListener: (type: "message", listener: (event: { data: unknown }) => void) => void;
|
|
8
|
+
removeEventListener?: (type: "message", listener: (event: { data: unknown }) => void) => void;
|
|
9
|
+
start?: () => void;
|
|
10
|
+
}
|
|
11
|
+
|
|
12
|
+
export interface WorkerHandle {
|
|
13
|
+
postMessage: (message: unknown, transfer?: unknown[]) => void;
|
|
14
|
+
terminate: () => void;
|
|
15
|
+
}
|
|
16
|
+
|
|
17
|
+
interface WebWorker {
|
|
18
|
+
postMessage: (message: unknown, transfer?: unknown[]) => void;
|
|
19
|
+
addEventListener: (type: string, listener: (event: { data: unknown }) => void) => void;
|
|
20
|
+
terminate: () => void;
|
|
21
|
+
}
|
|
22
|
+
|
|
23
|
+
declare const Worker: new (url: URL, options: { type: "module" }) => WebWorker;
|
|
24
|
+
|
|
25
|
+
// Whether this runtime runs workers: Web Workers, or Node's.
|
|
26
|
+
export const isWorkerSupported = () =>
|
|
27
|
+
typeof Worker === "function" ||
|
|
28
|
+
(typeof process !== "undefined" && process.versions?.node !== undefined);
|
|
29
|
+
|
|
30
|
+
// Starts the worker at url, which the caller writes as new URL("./name.js", import.meta.url) for
|
|
31
|
+
// bundlers to find. onError receives what the worker threw.
|
|
32
|
+
export const spawnWorker = async (
|
|
33
|
+
url: URL,
|
|
34
|
+
onMessage: (message: unknown) => void,
|
|
35
|
+
onError: (error: unknown) => void,
|
|
36
|
+
): Promise<WorkerHandle> => {
|
|
37
|
+
if (typeof Worker === "function") {
|
|
38
|
+
const worker = new Worker(url, { type: "module" });
|
|
39
|
+
worker.addEventListener("message", (event) => onMessage(event.data));
|
|
40
|
+
worker.addEventListener("error", onError);
|
|
41
|
+
return worker;
|
|
42
|
+
}
|
|
43
|
+
const threads: typeof import("node:worker_threads") = await import(
|
|
44
|
+
/* @vite-ignore */ /* webpackIgnore: true */ WORKER_THREADS_MODULE
|
|
45
|
+
);
|
|
46
|
+
const worker = new threads.Worker(url);
|
|
47
|
+
worker.on("message", onMessage);
|
|
48
|
+
worker.on("error", onError);
|
|
49
|
+
return {
|
|
50
|
+
postMessage: (message, transfer) =>
|
|
51
|
+
worker.postMessage(message, transfer as Parameters<typeof worker.postMessage>[1]),
|
|
52
|
+
terminate: () => void worker.terminate(),
|
|
53
|
+
};
|
|
54
|
+
};
|
|
55
|
+
|
|
56
|
+
// The port a worker receives its messages on and posts its own to.
|
|
57
|
+
export const getParentPort = async () => {
|
|
58
|
+
if (typeof (globalThis as { postMessage?: unknown }).postMessage === "function") {
|
|
59
|
+
return globalThis as unknown as Port;
|
|
60
|
+
}
|
|
61
|
+
const threads: typeof import("node:worker_threads") = await import(
|
|
62
|
+
/* @vite-ignore */ /* webpackIgnore: true */ WORKER_THREADS_MODULE
|
|
63
|
+
);
|
|
64
|
+
return threads.parentPort as unknown as Port;
|
|
65
|
+
};
|
package/dist/parallel.cjs
DELETED
|
@@ -1,12 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* @license tla-ts
|
|
3
|
-
*
|
|
4
|
-
* Copyright (c) Aiden Bai
|
|
5
|
-
*
|
|
6
|
-
* This source code is licensed under the MIT license found in the
|
|
7
|
-
* LICENSE file in the root directory of this source tree.
|
|
8
|
-
*/
|
|
9
|
-
const e=require("./transfer.cjs"),t=async e=>{if(typeof Worker==`function`){let t=new Worker(new URL(`./parallel-worker.js`,require("url").pathToFileURL(__filename).href),{type:`module`});return t.addEventListener(`message`,t=>e(t.data)),t.addEventListener(`error`,()=>e({type:`abort`})),t}let t=new(await(import(
|
|
10
|
-
/* @vite-ignore */
|
|
11
|
-
/* webpackIgnore: true */
|
|
12
|
-
`node:worker_threads`))).Worker(new URL(`./parallel-worker.js`,require("url").pathToFileURL(__filename).href));return t.on(`message`,e),t.on(`error`,()=>e({type:`abort`})),{postMessage:(e,n)=>t.postMessage(e,n),terminate:()=>void t.terminate()}},n=async n=>{let r=typeof n.config==`string`?e.Q(n.config,n.version):n.config,i=n.onPrint??console.log,a={count:0},o=e=>[e.kind,`name`in e?e.name:``,`count`in e?e.count:``,`text`in e?e.text:``].join(` `),s=/* @__PURE__ */ new Set,c=e=>{s.add(o(e)),n.onProgress?.(e)},l=()=>{let t={count:a.count};return e.l({...n,config:r,onPrint:e=>t.count-->0?void 0:i(e),onProgress:e=>{s.has(o(e))||n.onProgress?.(e)}})},u=n.workers??1;if(u<2||typeof SharedArrayBuffer!=`function`||n.dump!==void 0||r.view!==void 0||r.postconditions.length>0||r.possible.length>0)return l();let d=/* @__PURE__ */ new Map,f=e=>{let t=n.loadModule?.(e);return d.set(e,t),t},p=/* @__PURE__ */ new Map,m=e=>{let t=n.loadClass?.(e);return p.set(e,t),t};e.X(e.x(n.source,r,f)),e.Z(n.version);let h=e.Y(),g=e.y(r,{source:n.source,loadModule:f,loadClass:m,print:e=>{a.count++,i(e)},files:{readFile:n.readFile,writeFile:n.writeFile},isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isSanyReported:n.isSanyReported,isWarningEnabled:n.isWarningEnabled,version:n.version});e.p(g,r,c);let _=g.environment,v=e.u(r,_,()=>e.S(n.source,f),c);if(e.d(g.assumptions,_)||!v||v.spec.init===void 0||v.spec.next===void 0||v.properties.liveness.length>0||e.P(_))return l();let y=e.K(),b={fingerprints:e.i()},x=/* @__PURE__ */ new Int32Array(2),S=Array.from({length:u},e.n),C={generatedStates:0,distinctStates:0,queuedStates:0,depth:0,initialStates:void 0,outDegrees:Array.from({length:32},()=>0)},w=[],T=()=>({status:`success`,violation:void 0,failure:void 0,...C,fingerprintDistance:e.g(C.distinctStates,C.generatedStates,()=>{let e=new BigInt64Array(C.distinctStates);return w.reduce((t,n)=>(e.set(n,t),t+n.length),0),e})}),E=t=>{let n=[];for(let r of e.F(t,_,v.spec.scope))if(e.f(C.generatedStates,c),y(r),C.generatedStates++,e.c(v.getFingerprintState(r),x),e.s(b.fingerprints)&&(b.fingerprints=e.a(b.fingerprints)),e.o(b.fingerprints,x[0],x[1])){if(v.findViolatedInvariant(r)||v.findFailedInitialPredicate(r))return!1;if(v.satisfiesConstraints(r)){if(!S[n.length%u].encode(r))return!1;n.push(r),C.distinctStates++}}return w.push(BigInt64Array.from(n,e=>_.runtime.getFingerprint(e))),!0};c({kind:`initial-states-started`});try{if(!E(v.spec.init))return l()}catch(t){if(!(t instanceof e.ct))throw t;return l()}if(e.Y()!==h)return l();if(C.depth=C.generatedStates===0?0:1,C.initialStates={generated:C.generatedStates,distinct:C.distinctStates},c({kind:`initial-states-computed`,initialStates:C.initialStates}),C.distinctStates===0)return T();let D=[],O={count:u,resolve:e=>{}},k=e=>{D.push(e),(e.type===`abort`||D.length===O.count)&&O.resolve(D.splice(0))},A=e=>new Promise(t=>{O.count=e,O.resolve=t}),j=A(u),M=new Int32Array(new SharedArrayBuffer(u*4)),N=new Int32Array(new SharedArrayBuffer(u*4)),P=await Promise.all(Array.from({length:u},()=>t(k))),F=()=>P.forEach(e=>e.terminate()),I=/* @__PURE__ */ new Map,L=(e,t)=>{let n=e<t?`${e}:${t}`:`${t}:${e}`,r=I.get(n)??new MessageChannel;return I.set(n,r),e<t?r.port1:r.port2};P.forEach((e,t)=>{let i=Array.from({length:u},(e,n)=>n===t?void 0:L(t,n)),a=S[t].finish(),o={type:`start`,source:n.source,config:r,modules:[...d],classes:[...p],index:t,ports:i,seed:a,isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isWarningEnabled:n.isWarningEnabled,version:n.version,fingerprints:b.fingerprints,requests:M,remaining:N};e.postMessage(o,[...i.filter(e=>e!==void 0),a.words.buffer])});let R=e=>e.some(e=>e.type===`abort`),z=e=>P.forEach(t=>t.postMessage(e)),B=async t=>{let n=t.filter(e=>e.type===`paused`).length;if(n===0||R(t))return t;b.fingerprints=e.a(b.fingerprints);let r=A(n);return z({type:`resize`,fingerprints:b.fingerprints}),[...t.filter(e=>e.type!==`paused`),...await B(await r)]};if(R(await j))return F(),l();for(let e=1;;e++){let t=A(u);M.forEach((e,t)=>Atomics.store(M,t,0)),z({type:`level`,level:e});let n=await B(await t);if(R(n))return F(),l();let r=n.flatMap(e=>e.type===`level`?[e]:[]),i=r.reduce((e,t)=>e+t.added,0);if(C.generatedStates+=r.reduce((e,t)=>e+t.generated,0),C.distinctStates+=i,r.forEach(e=>{e.outDegrees.forEach((e,t)=>C.outDegrees[t]+=e),w.push(e.fingerprints)}),i===0)return F(),T();C.depth++}};Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return n}});
|
package/dist/parallel.js
DELETED
|
@@ -1,12 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* @license tla-ts
|
|
3
|
-
*
|
|
4
|
-
* Copyright (c) Aiden Bai
|
|
5
|
-
*
|
|
6
|
-
* This source code is licensed under the MIT license found in the
|
|
7
|
-
* LICENSE file in the root directory of this source tree.
|
|
8
|
-
*/
|
|
9
|
-
import{F as e,K as t,P as n,Q as r,S as i,X as ee,Y as a,Z as o,a as s,c,ct as te,d as l,f as u,g as d,i as f,l as p,n as ne,o as m,p as re,s as ie,u as ae,x as h,y as g}from"./transfer.js";const _=async e=>{if(typeof Worker==`function`){let t=new Worker(new URL(`./parallel-worker.js`,import.meta.url),{type:`module`});return t.addEventListener(`message`,t=>e(t.data)),t.addEventListener(`error`,()=>e({type:`abort`})),t}let t=new(await(import(
|
|
10
|
-
/* @vite-ignore */
|
|
11
|
-
/* webpackIgnore: true */
|
|
12
|
-
`node:worker_threads`))).Worker(new URL(`./parallel-worker.js`,import.meta.url));return t.on(`message`,e),t.on(`error`,()=>e({type:`abort`})),{postMessage:(e,n)=>t.postMessage(e,n),terminate:()=>void t.terminate()}},v=async v=>{let y=typeof v.config==`string`?r(v.config,v.version):v.config,b=v.onPrint??console.log,x={count:0},S=e=>[e.kind,`name`in e?e.name:``,`count`in e?e.count:``,`text`in e?e.text:``].join(` `),C=/* @__PURE__ */ new Set,w=e=>{C.add(S(e)),v.onProgress?.(e)},T=()=>{let e={count:x.count};return p({...v,config:y,onPrint:t=>e.count-->0?void 0:b(t),onProgress:e=>{C.has(S(e))||v.onProgress?.(e)}})},E=v.workers??1;if(E<2||typeof SharedArrayBuffer!=`function`||v.dump!==void 0||y.view!==void 0||y.postconditions.length>0||y.possible.length>0)return T();let D=/* @__PURE__ */ new Map,O=e=>{let t=v.loadModule?.(e);return D.set(e,t),t},k=/* @__PURE__ */ new Map,A=e=>{let t=v.loadClass?.(e);return k.set(e,t),t};ee(h(v.source,y,O)),o(v.version);let oe=a(),j=g(y,{source:v.source,loadModule:O,loadClass:A,print:e=>{x.count++,b(e)},files:{readFile:v.readFile,writeFile:v.writeFile},isTool:v.isTool,isTraceRecorded:v.isTraceRecorded,isSanyReported:v.isSanyReported,isWarningEnabled:v.isWarningEnabled,version:v.version});re(j,y,w);let M=j.environment,N=ae(y,M,()=>i(v.source,O),w);if(l(j.assumptions,M)||!N||N.spec.init===void 0||N.spec.next===void 0||N.properties.liveness.length>0||n(M))return T();let P=t(),F={fingerprints:f()},I=/* @__PURE__ */ new Int32Array(2),L=Array.from({length:E},ne),R={generatedStates:0,distinctStates:0,queuedStates:0,depth:0,initialStates:void 0,outDegrees:Array.from({length:32},()=>0)},z=[],B=()=>({status:`success`,violation:void 0,failure:void 0,...R,fingerprintDistance:d(R.distinctStates,R.generatedStates,()=>{let e=new BigInt64Array(R.distinctStates);return z.reduce((t,n)=>(e.set(n,t),t+n.length),0),e})}),V=t=>{let n=[];for(let r of e(t,M,N.spec.scope))if(u(R.generatedStates,w),P(r),R.generatedStates++,c(N.getFingerprintState(r),I),ie(F.fingerprints)&&(F.fingerprints=s(F.fingerprints)),m(F.fingerprints,I[0],I[1])){if(N.findViolatedInvariant(r)||N.findFailedInitialPredicate(r))return!1;if(N.satisfiesConstraints(r)){if(!L[n.length%E].encode(r))return!1;n.push(r),R.distinctStates++}}return z.push(BigInt64Array.from(n,e=>M.runtime.getFingerprint(e))),!0};w({kind:`initial-states-started`});try{if(!V(N.spec.init))return T()}catch(e){if(!(e instanceof te))throw e;return T()}if(a()!==oe)return T();if(R.depth=R.generatedStates===0?0:1,R.initialStates={generated:R.generatedStates,distinct:R.distinctStates},w({kind:`initial-states-computed`,initialStates:R.initialStates}),R.distinctStates===0)return B();let H=[],U={count:E,resolve:e=>{}},W=e=>{H.push(e),(e.type===`abort`||H.length===U.count)&&U.resolve(H.splice(0))},G=e=>new Promise(t=>{U.count=e,U.resolve=t}),K=G(E),q=new Int32Array(new SharedArrayBuffer(E*4)),se=new Int32Array(new SharedArrayBuffer(E*4)),J=await Promise.all(Array.from({length:E},()=>_(W))),Y=()=>J.forEach(e=>e.terminate()),X=/* @__PURE__ */ new Map,ce=(e,t)=>{let n=e<t?`${e}:${t}`:`${t}:${e}`,r=X.get(n)??new MessageChannel;return X.set(n,r),e<t?r.port1:r.port2};J.forEach((e,t)=>{let n=Array.from({length:E},(e,n)=>n===t?void 0:ce(t,n)),r=L[t].finish(),i={type:`start`,source:v.source,config:y,modules:[...D],classes:[...k],index:t,ports:n,seed:r,isTool:v.isTool,isTraceRecorded:v.isTraceRecorded,isWarningEnabled:v.isWarningEnabled,version:v.version,fingerprints:F.fingerprints,requests:q,remaining:se};e.postMessage(i,[...n.filter(e=>e!==void 0),r.words.buffer])});let Z=e=>e.some(e=>e.type===`abort`),Q=e=>J.forEach(t=>t.postMessage(e)),$=async e=>{let t=e.filter(e=>e.type===`paused`).length;if(t===0||Z(e))return e;F.fingerprints=s(F.fingerprints);let n=G(t);return Q({type:`resize`,fingerprints:F.fingerprints}),[...e.filter(e=>e.type!==`paused`),...await $(await n)]};if(Z(await K))return Y(),T();for(let e=1;;e++){let t=G(E);q.forEach((e,t)=>Atomics.store(q,t,0)),Q({type:`level`,level:e});let n=await $(await t);if(Z(n))return Y(),T();let r=n.flatMap(e=>e.type===`level`?[e]:[]),i=r.reduce((e,t)=>e+t.added,0);if(R.generatedStates+=r.reduce((e,t)=>e+t.generated,0),R.distinctStates+=i,r.forEach(e=>{e.outDegrees.forEach((e,t)=>R.outDegrees[t]+=e),z.push(e.fingerprints)}),i===0)return Y(),B();R.depth++}};export{v as t};
|