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.r084-tall-174860080700474.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 EisenbergMcGuire-PT-03, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 137K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K 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 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 121K 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 booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748741091917

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:24:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:24:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:24:53] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2025-06-01 01:24:53] [INFO ] Transformed 117 places.
[2025-06-01 01:24:53] [INFO ] Transformed 216 transitions.
[2025-06-01 01:24:53] [INFO ] Found NUPN structural information;
[2025-06-01 01:24:53] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 191 ms.
Built sparse matrix representations for Structural reductions in 6 ms.18415KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 117/117 places, 216/216 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 26 ms. Remains 117 /117 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 40 ms. Remains : 117/117 places, 216/216 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 117/117 places, 216/216 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 20 ms. Remains 117 /117 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2025-06-01 01:24:53] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
// Phase 1: matrix 153 rows 117 cols
[2025-06-01 01:24:53] [INFO ] Computed 10 invariants in 14 ms
[2025-06-01 01:24:53] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-06-01 01:24:53] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2025-06-01 01:24:53] [INFO ] Invariant cache hit.
[2025-06-01 01:24:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-01 01:24:54] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2025-06-01 01:24:54] [INFO ] Redundant transitions in 7 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-01 01:24:54] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2025-06-01 01:24:54] [INFO ] Invariant cache hit.
[2025-06-01 01:24:54] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 12 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 10 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:24:55] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:24:56] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 3 ms to minimize.
[2025-06-01 01:24:56] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:24:56] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:24:56] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:24:56] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:24:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:24:56] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 01:24:57] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:24:57] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2025-06-01 01:24:57] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:24:57] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:24:57] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:24:57] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:24:58] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:24:58] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:24:58] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:24:58] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 10/157 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 01:24:59] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:24:59] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:24:59] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 01:25:00] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 153/270 variables, 117/278 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 56/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 334 constraints, problems are : Problem set: 0 solved, 213 unsolved in 13322 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 34/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 153/270 variables, 117/278 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 56/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 213/547 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 01:25:10] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 3 ms to minimize.
[2025-06-01 01:25:10] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:25:10] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:25:10] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 01:25:14] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2025-06-01 01:25:16] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 553 constraints, problems are : Problem set: 0 solved, 213 unsolved in 17277 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 40/40 constraints]
After SMT, in 30700ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 30714ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 31177 ms. Remains : 117/117 places, 216/216 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2261 ms (no deadlock found). (steps per millisecond=552 )
Random directed walk for 1250002 steps, including 0 resets, run took 1327 ms (no deadlock found). (steps per millisecond=941 )
[2025-06-01 01:25:28] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2025-06-01 01:25:28] [INFO ] Invariant cache hit.
[2025-06-01 01:25:28] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-01 01:25:28] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-01 01:25:28] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-01 01:25:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 01:25:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-01 01:25:28] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-01 01:25:28] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-01 01:25:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-01 01:25:28] [INFO ] [Nat]Added 56 Read/Feed constraints in 14 ms returned sat
[2025-06-01 01:25:28] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:25:28] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:25:28] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:25:28] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:25:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 221 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 114 transition count 183
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 84 transition count 183
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 78 transition count 177
Applied a total of 78 rules in 23 ms. Remains 78 /117 variables (removed 39) and now considering 177/216 (removed 39) transitions.
[2025-06-01 01:25:29] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
// Phase 1: matrix 114 rows 78 cols
[2025-06-01 01:25:29] [INFO ] Computed 10 invariants in 3 ms
[2025-06-01 01:25:29] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-01 01:25:29] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2025-06-01 01:25:29] [INFO ] Invariant cache hit.
[2025-06-01 01:25:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-01 01:25:29] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-06-01 01:25:29] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2025-06-01 01:25:29] [INFO ] Invariant cache hit.
[2025-06-01 01:25:29] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:25:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:25:29] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2025-06-01 01:25:29] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2025-06-01 01:25:29] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:25:29] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:25:29] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 8 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2025-06-01 01:25:30] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:25:31] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:25:31] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:25:31] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:25:31] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:25:31] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:25:31] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:25:31] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:25:32] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 114/192 variables, 78/194 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 56/250 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:25:35] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/192 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 251 constraints, problems are : Problem set: 0 solved, 174 unsolved in 9821 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 29/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 114/192 variables, 78/195 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 56/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 174/425 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:25:41] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 426 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6270 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 30/30 constraints]
After SMT, in 16129ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 16131ms
Starting structural reductions in LIVENESS mode, iteration 1 : 78/117 places, 177/216 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 16377 ms. Remains : 78/117 places, 177/216 transitions.
Initial state reduction rules removed 3 formulas.
RANDOM walk for 40000 steps (8 resets) in 1264 ms. (31 steps per ms) remains 84/174 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 83/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 80/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 78/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 77/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 72/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 65/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 59/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
[2025-06-01 01:25:46] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2025-06-01 01:25:46] [INFO ] Invariant cache hit.
[2025-06-01 01:25:46] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 40/78 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-06-01 01:25:46] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:25:46] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2025-06-01 01:25:46] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2025-06-01 01:25:46] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:25:46] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:25:46] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:25:46] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:25:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2025-06-01 01:25:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 01:25:46] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 19/107 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2025-06-01 01:25:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 114/192 variables, 78/188 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 56/244 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 244 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2820 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 40/78 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 22/110 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-06-01 01:25:49] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:25:49] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 114/192 variables, 78/190 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 56/246 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 56/302 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-06-01 01:25:50] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2025-06-01 01:25:50] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-06-01 01:25:50] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:25:50] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:25:50] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:25:50] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 15 (OVERLAPS) 0/192 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 308 constraints, problems are : Problem set: 0 solved, 56 unsolved in 3149 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 30/30 constraints]
After SMT, in 6001ms problems are : Problem set: 0 solved, 56 unsolved
Fused 56 Parikh solutions to 55 different solutions.
Parikh walk visited 5 properties in 1400 ms.
Support contains 35 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 177/177 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 74 transition count 165
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 74 transition count 165
Applied a total of 8 rules in 14 ms. Remains 74 /78 variables (removed 4) and now considering 165/177 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 74/78 places, 165/177 transitions.
RANDOM walk for 4000000 steps (8 resets) in 25273 ms. (158 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 670 ms. (596 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 658 ms. (606 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 664 ms. (601 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 663 ms. (602 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 629 ms. (634 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 645 ms. (619 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 652 ms. (612 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 627 ms. (636 steps per ms) remains 48/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 657 ms. (607 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 662 ms. (603 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 636 ms. (627 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 647 ms. (617 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 652 ms. (612 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 637 ms. (626 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 642 ms. (622 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 614 ms. (650 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 651 ms. (613 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 633 ms. (630 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 639 ms. (625 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 642 ms. (622 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 647 ms. (617 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 609 ms. (655 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 598 ms. (667 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 611 ms. (653 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 653 ms. (611 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 651 ms. (613 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 602 ms. (663 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 618 ms. (646 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 660 ms. (605 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 666 ms. (599 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 662 ms. (603 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 688 ms. (580 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 664 ms. (601 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 627 ms. (636 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 633 ms. (630 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 626 ms. (637 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 641 ms. (623 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 622 ms. (642 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 649 ms. (615 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 666 ms. (599 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 657 ms. (607 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 673 ms. (593 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 662 ms. (603 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 658 ms. (606 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 661 ms. (604 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 673 ms. (593 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 656 ms. (608 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 668 ms. (597 steps per ms) remains 48/48 properties
Finished probabilistic random walk after 21925 steps, run visited all 48 properties in 137 ms. (steps per millisecond=160 )
Probabilistic random walk after 21925 steps, saw 5773 distinct states, run finished after 144 ms. (steps per millisecond=152 ) properties seen :48
Able to resolve query QuasiLiveness after proving 177 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 114 transition count 183
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 84 transition count 183
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 78 transition count 177
Applied a total of 78 rules in 16 ms. Remains 78 /117 variables (removed 39) and now considering 177/216 (removed 39) transitions.
[2025-06-01 01:26:08] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2025-06-01 01:26:08] [INFO ] Invariant cache hit.
[2025-06-01 01:26:08] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-01 01:26:08] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2025-06-01 01:26:08] [INFO ] Invariant cache hit.
[2025-06-01 01:26:08] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-01 01:26:08] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-06-01 01:26:08] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2025-06-01 01:26:08] [INFO ] Invariant cache hit.
[2025-06-01 01:26:08] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 114/192 variables, 78/194 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 56/250 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:26:14] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/192 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 251 constraints, problems are : Problem set: 0 solved, 174 unsolved in 9546 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 29/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 114/192 variables, 78/195 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 56/251 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 174/425 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2025-06-01 01:26:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 426 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6601 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 30/30 constraints]
After SMT, in 16185ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 16188ms
Starting structural reductions in LIVENESS mode, iteration 1 : 78/117 places, 177/216 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 16426 ms. Remains : 78/117 places, 177/216 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :177 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 177 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 91697 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-03

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 117
TRANSITIONS: 216
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 900
NUPN UNITS: 10
LOADING TIME: 0.259

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.024
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.498
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 998
MODEL NAME: /home/mcc/execution/model
117 places, 216 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1748741512198

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

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="EisenbergMcGuire-PT-03"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 EisenbergMcGuire-PT-03, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080700474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-03.tgz
mv EisenbergMcGuire-PT-03 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;