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.r494-smll-171636275100092.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 ltsminxred
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 r494-smll-171636275100092
=====================================================================

--------------------
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 1717219545071

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:25:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 05:25:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:25:47] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-06-01 05:25:47] [INFO ] Transformed 117 places.
[2024-06-01 05:25:47] [INFO ] Transformed 216 transitions.
[2024-06-01 05:25:47] [INFO ] Found NUPN structural information;
[2024-06-01 05:25:47] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 534 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 122 ms. Remains 78 /117 variables (removed 39) and now considering 177/216 (removed 39) transitions.
[2024-06-01 05:25:48] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
// Phase 1: matrix 114 rows 78 cols
[2024-06-01 05:25:48] [INFO ] Computed 10 invariants in 22 ms
[2024-06-01 05:25:48] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-06-01 05:25:48] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-06-01 05:25:48] [INFO ] Invariant cache hit.
[2024-06-01 05:25:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 05:25:49] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-01 05:25:49] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-06-01 05:25:49] [INFO ] Invariant cache hit.
[2024-06-01 05:25:49] [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-06-01 05:25:50] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 18 ms to minimize.
[2024-06-01 05:25:51] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 3 ms to minimize.
[2024-06-01 05:25:51] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-06-01 05:25:51] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 3 ms to minimize.
[2024-06-01 05:25:51] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 05:25:51] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:25:51] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:25:52] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-01 05:25:52] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 05:25:52] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-01 05:25:52] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 05:25:52] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:25:52] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-06-01 05:25:52] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 05:25:52] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:25:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:25:52] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 05:25:53] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 05:25:53] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 05:25:53] [INFO ] Deduced a trap composed of 15 places in 35 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-06-01 05:25:54] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-06-01 05:25:54] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:25:54] [INFO ] Deduced a trap composed of 23 places in 68 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-06-01 05:25:54] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-06-01 05:25:55] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
[2024-06-01 05:25:55] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:25:55] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 05:25:55] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 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-06-01 05:26:00] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 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 16613 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-06-01 05:26:09] [INFO ] Deduced a trap composed of 19 places in 47 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 9089 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 25950ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 25985ms
Starting structural reductions in LIVENESS mode, iteration 1 : 78/117 places, 177/216 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 27231 ms. Remains : 78/117 places, 177/216 transitions.
Initial state reduction rules removed 3 formulas.
RANDOM walk for 40000 steps (8 resets) in 2343 ms. (17 steps per ms) remains 86/174 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 83/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 82/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 78/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 71/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 70/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 69/70 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 16 ms. (235 steps per ms) remains 67/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 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 21 ms. (182 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 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 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 63/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 59/62 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 27 ms. (143 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 54/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
[2024-06-01 05:26:16] [INFO ] Flow matrix only has 114 transitions (discarded 63 similar events)
[2024-06-01 05:26:16] [INFO ] Invariant cache hit.
[2024-06-01 05:26:16] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 42/77 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 42/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 7 ms to minimize.
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:26:17] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 10/96 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 05:26:18] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 05:26:18] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:26:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:26:18] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:26:19] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:26:19] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:26:19] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-06-01 05:26:19] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 05:26:19] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 05:26:19] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:26:19] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
[2024-06-01 05:26:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:26:19] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (OVERLAPS) 114/192 variables, 78/189 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 56/245 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 05:26:20] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 05:26:20] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:26:21] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/192 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/192 variables, and 248 constraints, problems are : Problem set: 0 solved, 51 unsolved in 5011 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: 51/51 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 42/77 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 42/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 05:26:22] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 05:26:22] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (OVERLAPS) 114/192 variables, 78/194 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 56/250 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 51/301 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 05:26:23] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 19 (OVERLAPS) 0/192 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 302 constraints, problems are : Problem set: 0 solved, 51 unsolved in 3813 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: 51/51 constraints, Known Traps: 29/29 constraints]
After SMT, in 8851ms problems are : Problem set: 0 solved, 51 unsolved
Parikh walk visited 7 properties in 2887 ms.
Support contains 32 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 177/177 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 73 transition count 162
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 73 transition count 162
Applied a total of 10 rules in 21 ms. Remains 73 /78 variables (removed 5) and now considering 162/177 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 73/78 places, 162/177 transitions.
RANDOM walk for 4000000 steps (8 resets) in 26505 ms. (150 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 692 ms. (577 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 697 ms. (573 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 581 ms. (687 steps per ms) remains 42/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 573 ms. (696 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 668 ms. (597 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 663 ms. (602 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 653 ms. (611 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 644 ms. (620 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 688 ms. (580 steps per ms) remains 39/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 667 ms. (598 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 617 ms. (647 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 649 ms. (615 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 623 ms. (641 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 649 ms. (615 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 622 ms. (642 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 649 ms. (615 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 647 ms. (617 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 538 ms. (742 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 607 ms. (657 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 646 ms. (618 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 659 ms. (606 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 648 ms. (616 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 676 ms. (590 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 591 ms. (675 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 561 ms. (711 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 571 ms. (699 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 557 ms. (716 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 560 ms. (713 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 572 ms. (698 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 656 ms. (608 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 656 ms. (608 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 651 ms. (613 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 628 ms. (635 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 648 ms. (616 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 580 ms. (688 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 702 ms. (568 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 685 ms. (583 steps per ms) remains 39/39 properties
[2024-06-01 05:26:43] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
// Phase 1: matrix 99 rows 73 cols
[2024-06-01 05:26:43] [INFO ] Computed 10 invariants in 4 ms
[2024-06-01 05:26:43] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 45/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 05:26:43] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-06-01 05:26:43] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:26:43] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:26:43] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-06-01 05:26:43] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
[2024-06-01 05:26:43] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-01 05:26:43] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-06-01 05:26:44] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 05:26:44] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 1/73 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 05:26:44] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:26:44] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:26:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:26:44] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 05:26:45] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
[2024-06-01 05:26:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 05:26:45] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:26:45] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 99/172 variables, 73/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 46/146 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 05:26:46] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-06-01 05:26:46] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/172 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 16 (OVERLAPS) 0/172 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 148 constraints, problems are : Problem set: 0 solved, 39 unsolved in 4678 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 45/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 05:26:48] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 1/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 99/172 variables, 73/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 46/149 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 39/188 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 05:26:50] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/172 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 15 (OVERLAPS) 0/172 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 189 constraints, problems are : Problem set: 0 solved, 39 unsolved in 3553 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 21/21 constraints]
After SMT, in 8258ms problems are : Problem set: 0 solved, 39 unsolved
Parikh walk visited 0 properties in 1290 ms.
Support contains 27 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 162/162 transitions.
Applied a total of 0 rules in 8 ms. Remains 73 /73 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 73/73 places, 162/162 transitions.
RANDOM walk for 4000000 steps (8 resets) in 23059 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 618 ms. (646 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 843 ms. (473 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 825 ms. (484 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 580 ms. (688 steps per ms) remains 37/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 644 ms. (620 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 644 ms. (620 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 641 ms. (623 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 599 ms. (666 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 603 ms. (662 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 621 ms. (643 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 598 ms. (667 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 591 ms. (675 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 640 ms. (624 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 645 ms. (619 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 638 ms. (625 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 632 ms. (631 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 533 ms. (749 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 529 ms. (754 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 620 ms. (644 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 625 ms. (638 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 838 ms. (476 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 720 ms. (554 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 541 ms. (738 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 551 ms. (724 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 552 ms. (723 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 542 ms. (736 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 560 ms. (713 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 715 ms. (558 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 778 ms. (513 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 609 ms. (655 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 633 ms. (630 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 630 ms. (633 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 611 ms. (653 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 600 ms. (665 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 568 ms. (702 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 665 ms. (600 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 615 ms. (649 steps per ms) remains 37/37 properties
Finished probabilistic random walk after 19877 steps, run visited all 37 properties in 211 ms. (steps per millisecond=94 )
Probabilistic random walk after 19877 steps, saw 5251 distinct states, run finished after 219 ms. (steps per millisecond=90 ) properties seen :37
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 79490 ms.
ITS solved all properties within timeout

BK_STOP 1717219626885

--------------------
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="ltsminxred"
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 ltsminxred"
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 r494-smll-171636275100092"
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 ;