Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r166-smll-171636274300092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is EisenbergMcGuire-PT-03, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-171636274300092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 121K May 18 16:42 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716475690485

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
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
[2024-05-23 14:48:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-23 14:48:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:48:13] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-23 14:48:13] [INFO ] Transformed 117 places.
[2024-05-23 14:48:13] [INFO ] Transformed 216 transitions.
[2024-05-23 14:48:13] [INFO ] Found NUPN structural information;
[2024-05-23 14:48:13] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 441 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 2 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 2 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 121 ms. Remains 78 /117 variables (removed 39) and now considering 177/216 (removed 39) transitions.
[2024-05-23 14:48:13] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
// Phase 1: matrix 114 rows 78 cols
[2024-05-23 14:48:13] [INFO ] Computed 10 invariants in 13 ms
[2024-05-23 14:48:14] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-23 14:48:14] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-05-23 14:48:14] [INFO ] Invariant cache hit.
[2024-05-23 14:48:14] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 14:48:14] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-23 14:48:14] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-05-23 14:48:14] [INFO ] Invariant cache hit.
[2024-05-23 14:48:14] [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
[2024-05-23 14:48:16] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 12 ms to minimize.
[2024-05-23 14:48:16] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-23 14:48:16] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-05-23 14:48:16] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-23 14:48:16] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-23 14:48:16] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-23 14:48:17] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-23 14:48:17] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 3 ms to minimize.
[2024-05-23 14:48:17] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 3 ms to minimize.
[2024-05-23 14:48:17] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-23 14:48:17] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-23 14:48:17] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-23 14:48:17] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 3 ms to minimize.
[2024-05-23 14:48:17] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-23 14:48:17] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-23 14:48:17] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:48:18] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-05-23 14:48:18] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-23 14:48:18] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:48:18] [INFO ] Deduced a trap composed of 15 places in 46 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
[2024-05-23 14:48:19] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-23 14:48:19] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 3 ms to minimize.
[2024-05-23 14:48:20] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-23 14:48:20] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-23 14:48:20] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:48:20] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:48:20] [INFO ] Deduced a trap composed of 22 places in 53 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
[2024-05-23 14:48:21] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 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
[2024-05-23 14:48:26] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 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 17201 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
[2024-05-23 14:48:35] [INFO ] Deduced a trap composed of 19 places in 45 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 9889 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 27350ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 27399ms
Starting structural reductions in LIVENESS mode, iteration 1 : 78/117 places, 177/216 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 28674 ms. Remains : 78/117 places, 177/216 transitions.
Initial state reduction rules removed 3 formulas.
RANDOM walk for 40000 steps (8 resets) in 2417 ms. (16 steps per ms) remains 87/174 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 85/87 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 83/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 78/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 75/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 71/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 69/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 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 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/68 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 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 56/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
[2024-05-23 14:48:43] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-05-23 14:48:43] [INFO ] Invariant cache hit.
[2024-05-23 14:48:43] [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
[2024-05-23 14:48:44] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 3 ms to minimize.
[2024-05-23 14:48:44] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-23 14:48:44] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-23 14:48:44] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-23 14:48:44] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-23 14:48:45] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:48:46] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 12 ms to minimize.
[2024-05-23 14:48:47] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 8/116 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 114/192 variables, 78/194 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 56/250 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-23 14:48:48] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:48:48] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/192 variables, and 252 constraints, problems are : Problem set: 0 solved, 56 unsolved in 5015 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]
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, 30/118 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-23 14:48:49] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 114/192 variables, 78/197 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 56/253 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 56/309 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-23 14:48:51] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 310 constraints, problems are : Problem set: 0 solved, 56 unsolved in 5008 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: 32/32 constraints]
After SMT, in 10071ms problems are : Problem set: 0 solved, 56 unsolved
Fused 56 Parikh solutions to 47 different solutions.
Parikh walk visited 6 properties in 2821 ms.
Support contains 34 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 28 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 28 ms. Remains : 74/78 places, 165/177 transitions.
RANDOM walk for 4000000 steps (8 resets) in 28142 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1129 ms. (353 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1083 ms. (369 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 680 ms. (587 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 614 ms. (650 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 678 ms. (589 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 681 ms. (586 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 638 ms. (625 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 715 ms. (558 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 715 ms. (558 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 684 ms. (583 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 909 ms. (439 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 756 ms. (528 steps per ms) remains 46/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 677 ms. (589 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 684 ms. (583 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 685 ms. (583 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 763 ms. (523 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 845 ms. (472 steps per ms) remains 44/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 689 ms. (579 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 689 ms. (579 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 685 ms. (583 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 685 ms. (583 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 573 ms. (696 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 582 ms. (686 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 681 ms. (586 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 672 ms. (594 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 761 ms. (524 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 989 ms. (404 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 751 ms. (531 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 808 ms. (494 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 573 ms. (696 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 638 ms. (625 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 673 ms. (593 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 710 ms. (562 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 666 ms. (599 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 653 ms. (611 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 637 ms. (626 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 654 ms. (610 steps per ms) remains 41/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 789 ms. (506 steps per ms) remains 41/41 properties
[2024-05-23 14:49:13] [INFO ] Flow matrix only has 102 transitions (discarded 63 similar events)
// Phase 1: matrix 102 rows 74 cols
[2024-05-23 14:49:13] [INFO ] Computed 10 invariants in 4 ms
[2024-05-23 14:49:13] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 46/73 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:14] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-05-23 14:49:14] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-23 14:49:14] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:49:14] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-23 14:49:14] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-23 14:49:14] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-23 14:49:14] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:49:14] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:49:15] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-23 14:49:15] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-23 14:49:15] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-23 14:49:15] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:15] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-23 14:49:15] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-23 14:49:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/74 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:16] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:49:16] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:49:16] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-23 14:49:16] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 102/176 variables, 74/103 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 48/151 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:17] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-23 14:49:17] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:49:17] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:18] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:18] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/176 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/176 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:19] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/176 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/176 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 19 (OVERLAPS) 0/176 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 157 constraints, problems are : Problem set: 0 solved, 41 unsolved in 7198 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 46/73 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:21] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:49:21] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/74 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:22] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 102/176 variables, 74/112 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 48/160 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 41/201 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 15 (OVERLAPS) 0/176 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 201 constraints, problems are : Problem set: 0 solved, 41 unsolved in 3104 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 28/28 constraints]
After SMT, in 10338ms problems are : Problem set: 0 solved, 41 unsolved
Parikh walk visited 4 properties in 1335 ms.
Support contains 24 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 165/165 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 73 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 162
Applied a total of 2 rules in 12 ms. Remains 73 /74 variables (removed 1) and now considering 162/165 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 73/74 places, 162/165 transitions.
RANDOM walk for 4000000 steps (8 resets) in 22662 ms. (176 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 744 ms. (536 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 929 ms. (430 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 712 ms. (561 steps per ms) remains 36/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 627 ms. (636 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 643 ms. (621 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 555 ms. (719 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 627 ms. (636 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 596 ms. (670 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 614 ms. (650 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 617 ms. (647 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 637 ms. (626 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 630 ms. (633 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 627 ms. (636 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 636 ms. (627 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 617 ms. (647 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 634 ms. (629 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 628 ms. (635 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 623 ms. (641 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 625 ms. (638 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 615 ms. (649 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 550 ms. (725 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 528 ms. (756 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 607 ms. (657 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 612 ms. (652 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 646 ms. (618 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 549 ms. (727 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 537 ms. (743 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 529 ms. (754 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 541 ms. (738 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 535 ms. (746 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1235 ms. (323 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 619 ms. (645 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 613 ms. (651 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 592 ms. (674 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 612 ms. (652 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 618 ms. (646 steps per ms) remains 36/36 properties
Finished probabilistic random walk after 19877 steps, run visited all 36 properties in 194 ms. (steps per millisecond=102 )
Probabilistic random walk after 19877 steps, saw 5251 distinct states, run finished after 201 ms. (steps per millisecond=98 ) properties seen :36
Able to resolve query QuasiLiveness after proving 177 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 87040 ms.
ITS solved all properties within timeout

BK_STOP 1716475780073

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -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="QuasiLiveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is EisenbergMcGuire-PT-03, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r166-smll-171636274300092"
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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;