Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r125-tall-174876435800076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is LamportFastMutEx-COL-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435800076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 39K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748775802231

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-01 11:03:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 11:03:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:03:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 11:03:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 11:03:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2025-06-01 11:03:24] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2025-06-01 11:03:24] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2025-06-01 11:03:24] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2025-06-01 11:03:24] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 1, 3, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 1, 1, 3, 3, 9, 3, 3, 3, 3, 3, 3, 3, 9, 3, 3]
FORMULA LamportFastMutEx-COL-3-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-01 11:03:24] [INFO ] Invariant cache hit.
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 11:03:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 11:03:24] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:03:24] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 9 ms.
[2025-06-01 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:24] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:24] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:24] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:03:24] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:24] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:24] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:24] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:24] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:24] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:24] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 11:03:24] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:24] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:24] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:25] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:25] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2025-06-01 11:03:25] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:25] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:25] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2025-06-01 11:03:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:03:25] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:25] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:25] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:25] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 11:03:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:25] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:25] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 9, 3, 3, 3, 3, 3, 3, 9, 3, 3]
Domain [pid(4), pid(4)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-01 11:03:25] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 20 ms.
[2025-06-01 11:03:25] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 9, 3, 3, 3, 3, 3, 3, 9, 3, 3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 9, 3, 3, 3, 3, 3, 3, 9, 3, 3]
[2025-06-01 11:03:25] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2025-06-01 11:03:25] [INFO ] Computed 17 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 9, 3, 3, 3, 3, 3, 3, 9, 3, 3]
RANDOM walk for 10000 steps (2 resets) in 40 ms. (243 steps per ms)
FORMULA LamportFastMutEx-COL-3-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (16 resets) in 95 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 6, 2, 2, 2, 6, 1, 2] Max Struct:[3, 9, 3, 3, 3, 9, 3, 3]
[2025-06-01 11:03:25] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2025-06-01 11:03:25] [INFO ] Invariant cache hit.
[2025-06-01 11:03:25] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 11:03:25] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-01 11:03:25] [INFO ] [Real]Added 27 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:03:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-01 11:03:25] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 8 ms to minimize.
[2025-06-01 11:03:25] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2025-06-01 11:03:25] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 3 ms to minimize.
[2025-06-01 11:03:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2025-06-01 11:03:25] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:03:25] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2025-06-01 11:03:25] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:03:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 244 ms
[2025-06-01 11:03:25] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Real]Added 27 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:03:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 11:03:25] [INFO ] [Nat]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:03:25] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:03:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 5 ms to minimize.
[2025-06-01 11:03:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 257 ms
[2025-06-01 11:03:26] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:26] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 11:03:26] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:03:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:26] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-01 11:03:26] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 3 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 424 ms
[2025-06-01 11:03:26] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 11:03:26] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:03:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-01 11:03:26] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 11:03:26] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:26] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 325 ms
[2025-06-01 11:03:27] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:27] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 11:03:27] [INFO ] [Real]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:03:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:27] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-01 11:03:27] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 240 ms
[2025-06-01 11:03:27] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:27] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 11:03:27] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:03:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:27] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 11:03:27] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:03:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 405 ms
[2025-06-01 11:03:27] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Added 27 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2025-06-01 11:03:28] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:03:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 93/306/87 causal constraints (skipped 6 transitions) in 7 ms.
[2025-06-01 11:03:28] [INFO ] Added : 27 causal constraints over 6 iterations in 49 ms. Result :sat
Minimization took 28 ms.
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2025-06-01 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2025-06-01 11:03:28] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:03:28] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:28] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:03:28] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:03:28] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:03:28] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:03:28] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:03:28] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:28] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:03:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 284 ms
Current structural bounds on expressions (after SMT) : Max Seen:[2, 6, 2, 2, 2, 6, 1, 2] Max Struct:[2, 6, 2, 2, 2, 6, 3, 2]
FORMULA LamportFastMutEx-COL-3-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 114/114 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 68 transition count 111
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 68 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 65 transition count 108
Applied a total of 12 rules in 38 ms. Remains 65 /71 variables (removed 6) and now considering 108/114 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 65/71 places, 108/114 transitions.
[2025-06-01 11:03:28] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 65 cols
[2025-06-01 11:03:28] [INFO ] Computed 17 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (2 resets) in 1098 ms. (909 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 431 ms. (2314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2025-06-01 11:03:30] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2025-06-01 11:03:30] [INFO ] Invariant cache hit.
[2025-06-01 11:03:30] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 11:03:30] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-01 11:03:30] [INFO ] [Real]Added 27 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:03:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:30] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-01 11:03:30] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:03:30] [INFO ] Computed and/alt/rep : 78/291/78 causal constraints (skipped 9 transitions) in 5 ms.
[2025-06-01 11:03:30] [INFO ] Added : 31 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/65 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-06-01 11:03:30] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2025-06-01 11:03:30] [INFO ] Invariant cache hit.
[2025-06-01 11:03:30] [INFO ] Implicit Places using invariants in 64 ms returned [44, 45, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/65 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76 ms. Remains : 62/65 places, 108/108 transitions.
[2025-06-01 11:03:30] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2025-06-01 11:03:30] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (2 resets) in 970 ms. (1029 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 414 ms. (2409 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2025-06-01 11:03:31] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2025-06-01 11:03:31] [INFO ] Invariant cache hit.
[2025-06-01 11:03:31] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:31] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 11:03:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 11:03:31] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:03:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-01 11:03:32] [INFO ] Computed and/alt/rep : 78/267/78 causal constraints (skipped 9 transitions) in 4 ms.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 162 ms
[2025-06-01 11:03:32] [INFO ] Added : 44 causal constraints over 9 iterations in 227 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 62/62 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-06-01 11:03:32] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2025-06-01 11:03:32] [INFO ] Invariant cache hit.
[2025-06-01 11:03:32] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-01 11:03:32] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2025-06-01 11:03:32] [INFO ] Invariant cache hit.
[2025-06-01 11:03:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 11:03:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2025-06-01 11:03:32] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-01 11:03:32] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2025-06-01 11:03:32] [INFO ] Invariant cache hit.
[2025-06-01 11:03:32] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 20/34 constraints. Problems are: Problem set: 9 solved, 96 unsolved
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 5/59 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 4/63 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 2/65 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/65 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 90/152 variables, 62/127 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 18/145 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2025-06-01 11:03:35] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/146 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/146 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/152 variables, 0/146 constraints. Problems are: Problem set: 18 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 146 constraints, problems are : Problem set: 18 solved, 87 unsolved in 3925 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 18 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 34/39 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/39 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 3/62 variables, 9/48 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 18/66 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2025-06-01 11:03:36] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:03:36] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2025-06-01 11:03:36] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/69 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/70 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 2/72 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/72 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 90/152 variables, 62/134 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 18/152 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 87/239 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2025-06-01 11:03:38] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:03:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:03:38] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2025-06-01 11:03:38] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:03:38] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 5/244 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/244 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2025-06-01 11:03:39] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/152 variables, 1/245 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/245 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 16 (OVERLAPS) 0/152 variables, 0/245 constraints. Problems are: Problem set: 18 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 245 constraints, problems are : Problem set: 18 solved, 87 unsolved in 4866 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 87/105 constraints, Known Traps: 64/64 constraints]
After SMT, in 8847ms problems are : Problem set: 18 solved, 87 unsolved
Search for dead transitions found 18 dead transitions in 8853ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/62 places, 90/108 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2025-06-01 11:03:41] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9007 ms. Remains : 62/62 places, 90/108 transitions.
[2025-06-01 11:03:41] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
// Phase 1: matrix 78 rows 62 cols
[2025-06-01 11:03:41] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (2 resets) in 950 ms. (1051 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 409 ms. (2439 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2025-06-01 11:03:42] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2025-06-01 11:03:42] [INFO ] Invariant cache hit.
[2025-06-01 11:03:42] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:42] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 11:03:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-01 11:03:42] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:03:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 11:03:42] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 11:03:42] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-01 11:03:42] [INFO ] Computed and/alt/rep : 66/219/66 causal constraints (skipped 9 transitions) in 4 ms.
[2025-06-01 11:03:42] [INFO ] Added : 40 causal constraints over 8 iterations in 54 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 62/62 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2025-06-01 11:03:42] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2025-06-01 11:03:42] [INFO ] Invariant cache hit.
[2025-06-01 11:03:43] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-01 11:03:43] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2025-06-01 11:03:43] [INFO ] Invariant cache hit.
[2025-06-01 11:03:43] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-01 11:03:43] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2025-06-01 11:03:43] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2025-06-01 11:03:43] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2025-06-01 11:03:43] [INFO ] Invariant cache hit.
[2025-06-01 11:03:43] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 78/140 variables, 62/129 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/140 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 144 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3450 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 3/62 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2025-06-01 11:03:46] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:03:46] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:03:46] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
[2025-06-01 11:03:46] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:47] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:47] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2025-06-01 11:03:47] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2025-06-01 11:03:47] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 78/140 variables, 62/137 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 15/152 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 87/239 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2025-06-01 11:03:47] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:03:48] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2025-06-01 11:03:48] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:03:48] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:03:48] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2025-06-01 11:03:48] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:03:48] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (OVERLAPS) 0/140 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 247 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4073 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 69/69 constraints]
After SMT, in 7543ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 7545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7667 ms. Remains : 62/62 places, 90/90 transitions.
[2025-06-01 11:03:50] [INFO ] Flatten gal took : 53 ms
[2025-06-01 11:03:50] [INFO ] Flatten gal took : 19 ms
[2025-06-01 11:03:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16824132641449982192.gal : 16 ms
[2025-06-01 11:03:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality590977808996451872.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16824132641449982192.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality590977808996451872.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (8 resets) in 712 ms. (56 steps per ms) remains 2/2 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality590977808996451872.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 29
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :29 after 53
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :53 after 103
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :103 after 230
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :230 after 1363
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1363 after 3273
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3273 after 8478
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,15512,0.35336,17724,2,5572,15,45310,8,0,342,53216,0
Total reachable state count : 15512

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.357133,17984,1,0,15,45310,8,0,347,53216,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.359442,17984,1,0,15,45310,8,0,351,53216,0
ITS tools runner thread asked to quit. Dying gracefully.
Probably explored full state space saw : 15511 states, properties seen :0
Probabilistic random walk after 61095 steps, saw 15511 distinct states, run finished after 288 ms. (steps per millisecond=212 ) properties seen :0
Explored full state space saw : 15512 states, properties seen :0
Exhaustive walk after 61100 steps, saw 15512 distinct states, run finished after 143 ms. (steps per millisecond=427 ) properties seen :0
FORMULA LamportFastMutEx-COL-3-UpperBounds-14 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 28070 ms.

BK_STOP 1748775831493

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is LamportFastMutEx-COL-3, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r125-tall-174876435800076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-3.tgz
mv LamportFastMutEx-COL-3 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;