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.r466-smll-171620124700222.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 Anderson-PT-09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124700222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 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 927K 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 1717201327960

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:22:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 00:22:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:22:10] [INFO ] Load time of PNML (sax parser for PT used): 295 ms
[2024-06-01 00:22:10] [INFO ] Transformed 505 places.
[2024-06-01 00:22:10] [INFO ] Transformed 1845 transitions.
[2024-06-01 00:22:10] [INFO ] Found NUPN structural information;
[2024-06-01 00:22:10] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 508 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 505 transition count 1773
Deduced a syphon composed of 72 places in 10 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 433 transition count 1773
Applied a total of 144 rules in 138 ms. Remains 433 /505 variables (removed 72) and now considering 1773/1845 (removed 72) transitions.
// Phase 1: matrix 1773 rows 433 cols
[2024-06-01 00:22:10] [INFO ] Computed 21 invariants in 82 ms
[2024-06-01 00:22:13] [INFO ] Implicit Places using invariants in 3002 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3064 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 432/505 places, 1773/1845 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 432 transition count 1692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 351 transition count 1692
Applied a total of 162 rules in 46 ms. Remains 351 /432 variables (removed 81) and now considering 1692/1773 (removed 81) transitions.
// Phase 1: matrix 1692 rows 351 cols
[2024-06-01 00:22:13] [INFO ] Computed 20 invariants in 26 ms
[2024-06-01 00:22:15] [INFO ] Implicit Places using invariants in 1642 ms returned []
[2024-06-01 00:22:15] [INFO ] Invariant cache hit.
[2024-06-01 00:22:16] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-06-01 00:22:21] [INFO ] Implicit Places using invariants and state equation in 5707 ms returned []
Implicit Place search using SMT with State Equation took 7358 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 351/505 places, 1692/1845 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 10640 ms. Remains : 351/505 places, 1692/1845 transitions.
Initial state reduction rules removed 9 formulas.
RANDOM walk for 40000 steps (8 resets) in 6016 ms. (6 steps per ms) remains 773/1683 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 773/773 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 773/773 properties
[2024-06-01 00:22:23] [INFO ] Invariant cache hit.
[2024-06-01 00:22:23] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 773 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 149/2043 variables, and 150 constraints, problems are : Problem set: 0 solved, 773 unsolved in 5076 ms.
Refiners :[Domain max(s): 149/351 constraints, Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 1/10 constraints, State Equation: 0/351 constraints, ReadFeed: 0/135 constraints, PredecessorRefiner: 773/773 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 773 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 773 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 149/2043 variables, and 150 constraints, problems are : Problem set: 0 solved, 773 unsolved in 5048 ms.
Refiners :[Domain max(s): 149/351 constraints, Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 1/10 constraints, State Equation: 0/351 constraints, ReadFeed: 0/135 constraints, PredecessorRefiner: 0/773 constraints, Known Traps: 0/0 constraints]
After SMT, in 13750ms problems are : Problem set: 0 solved, 773 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 149 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 1692/1692 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 315 transition count 1656
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 315 transition count 1656
Applied a total of 72 rules in 207 ms. Remains 315 /351 variables (removed 36) and now considering 1656/1692 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 315/351 places, 1656/1692 transitions.
RANDOM walk for 2933213 steps (8 resets) in 120004 ms. (24 steps per ms) remains 269/773 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 265/269 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 260/265 properties
BEST_FIRST walk for 40004 steps (8 resets) in 487 ms. (81 steps per ms) remains 253/260 properties
BEST_FIRST walk for 40004 steps (8 resets) in 740 ms. (53 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (8 resets) in 450 ms. (88 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40002 steps (8 resets) in 530 ms. (75 steps per ms) remains 253/253 properties
BEST_FIRST walk for 40003 steps (8 resets) in 637 ms. (62 steps per ms) remains 252/253 properties
BEST_FIRST walk for 40003 steps (8 resets) in 636 ms. (62 steps per ms) remains 251/252 properties
BEST_FIRST walk for 40002 steps (8 resets) in 483 ms. (82 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 102/251 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 278 ms. (143 steps per ms) remains 97/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 264 ms. (150 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 94/97 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40001 steps (8 resets) in 194 ms. (205 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40001 steps (8 resets) in 193 ms. (206 steps per ms) remains 92/94 properties
BEST_FIRST walk for 40001 steps (8 resets) in 197 ms. (202 steps per ms) remains 89/92 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 82/89 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 82/82 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 81/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40002 steps (8 resets) in 191 ms. (208 steps per ms) remains 79/81 properties
BEST_FIRST walk for 40002 steps (8 resets) in 148 ms. (268 steps per ms) remains 79/79 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 79/79 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 79/79 properties
BEST_FIRST walk for 40002 steps (8 resets) in 123 ms. (322 steps per ms) remains 73/79 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 73/73 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 73/73 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 73/73 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 73/73 properties
BEST_FIRST walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 72/73 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40002 steps (8 resets) in 159 ms. (250 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 68/72 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40002 steps (8 resets) in 218 ms. (182 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 63/68 properties
BEST_FIRST walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 59/63 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 59/59 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 55/59 properties
BEST_FIRST walk for 40001 steps (8 resets) in 141 ms. (281 steps per ms) remains 55/55 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 55/55 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 53/55 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 53/53 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 53/53 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 51/53 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40001 steps (8 resets) in 168 ms. (236 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 48/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 48/48 properties
// Phase 1: matrix 1656 rows 315 cols
[2024-06-01 00:23:12] [INFO ] Computed 20 invariants in 16 ms
[2024-06-01 00:23:12] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 256/291 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 23/314 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 00:23:14] [INFO ] Deduced a trap composed of 97 places in 648 ms of which 53 ms to minimize.
[2024-06-01 00:23:15] [INFO ] Deduced a trap composed of 56 places in 683 ms of which 7 ms to minimize.
[2024-06-01 00:23:16] [INFO ] Deduced a trap composed of 80 places in 570 ms of which 5 ms to minimize.
[2024-06-01 00:23:16] [INFO ] Deduced a trap composed of 80 places in 560 ms of which 4 ms to minimize.
[2024-06-01 00:23:17] [INFO ] Deduced a trap composed of 54 places in 452 ms of which 4 ms to minimize.
[2024-06-01 00:23:17] [INFO ] Deduced a trap composed of 140 places in 468 ms of which 4 ms to minimize.
[2024-06-01 00:23:18] [INFO ] Deduced a trap composed of 96 places in 620 ms of which 5 ms to minimize.
[2024-06-01 00:23:18] [INFO ] Deduced a trap composed of 57 places in 541 ms of which 5 ms to minimize.
[2024-06-01 00:23:19] [INFO ] Deduced a trap composed of 62 places in 591 ms of which 5 ms to minimize.
[2024-06-01 00:23:19] [INFO ] Deduced a trap composed of 99 places in 572 ms of which 5 ms to minimize.
[2024-06-01 00:23:20] [INFO ] Deduced a trap composed of 117 places in 552 ms of which 4 ms to minimize.
[2024-06-01 00:23:21] [INFO ] Deduced a trap composed of 73 places in 683 ms of which 4 ms to minimize.
[2024-06-01 00:23:21] [INFO ] Deduced a trap composed of 55 places in 640 ms of which 5 ms to minimize.
[2024-06-01 00:23:22] [INFO ] Deduced a trap composed of 108 places in 680 ms of which 5 ms to minimize.
[2024-06-01 00:23:23] [INFO ] Deduced a trap composed of 60 places in 713 ms of which 5 ms to minimize.
[2024-06-01 00:23:23] [INFO ] Deduced a trap composed of 108 places in 698 ms of which 5 ms to minimize.
[2024-06-01 00:23:24] [INFO ] Deduced a trap composed of 100 places in 646 ms of which 6 ms to minimize.
[2024-06-01 00:23:25] [INFO ] Deduced a trap composed of 98 places in 616 ms of which 5 ms to minimize.
[2024-06-01 00:23:26] [INFO ] Deduced a trap composed of 81 places in 662 ms of which 6 ms to minimize.
[2024-06-01 00:23:26] [INFO ] Deduced a trap composed of 40 places in 701 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 00:23:27] [INFO ] Deduced a trap composed of 103 places in 414 ms of which 3 ms to minimize.
[2024-06-01 00:23:27] [INFO ] Deduced a trap composed of 145 places in 404 ms of which 3 ms to minimize.
[2024-06-01 00:23:28] [INFO ] Deduced a trap composed of 91 places in 402 ms of which 3 ms to minimize.
[2024-06-01 00:23:29] [INFO ] Deduced a trap composed of 84 places in 771 ms of which 25 ms to minimize.
[2024-06-01 00:23:29] [INFO ] Deduced a trap composed of 117 places in 407 ms of which 3 ms to minimize.
[2024-06-01 00:23:30] [INFO ] Deduced a trap composed of 157 places in 562 ms of which 5 ms to minimize.
[2024-06-01 00:23:30] [INFO ] Deduced a trap composed of 126 places in 664 ms of which 6 ms to minimize.
[2024-06-01 00:23:31] [INFO ] Deduced a trap composed of 48 places in 637 ms of which 5 ms to minimize.
[2024-06-01 00:23:32] [INFO ] Deduced a trap composed of 140 places in 670 ms of which 5 ms to minimize.
[2024-06-01 00:23:32] [INFO ] Deduced a trap composed of 57 places in 684 ms of which 5 ms to minimize.
[2024-06-01 00:23:33] [INFO ] Deduced a trap composed of 44 places in 666 ms of which 5 ms to minimize.
[2024-06-01 00:23:34] [INFO ] Deduced a trap composed of 103 places in 679 ms of which 5 ms to minimize.
[2024-06-01 00:23:35] [INFO ] Deduced a trap composed of 97 places in 621 ms of which 5 ms to minimize.
[2024-06-01 00:23:35] [INFO ] Deduced a trap composed of 58 places in 619 ms of which 8 ms to minimize.
[2024-06-01 00:23:36] [INFO ] Deduced a trap composed of 50 places in 693 ms of which 8 ms to minimize.
[2024-06-01 00:23:37] [INFO ] Deduced a trap composed of 46 places in 653 ms of which 5 ms to minimize.
[2024-06-01 00:23:37] [INFO ] Deduced a trap composed of 159 places in 658 ms of which 5 ms to minimize.
[2024-06-01 00:23:38] [INFO ] Deduced a trap composed of 97 places in 726 ms of which 6 ms to minimize.
[2024-06-01 00:23:39] [INFO ] Deduced a trap composed of 88 places in 668 ms of which 7 ms to minimize.
[2024-06-01 00:23:39] [INFO ] Deduced a trap composed of 68 places in 686 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 00:23:41] [INFO ] Deduced a trap composed of 111 places in 664 ms of which 6 ms to minimize.
[2024-06-01 00:23:42] [INFO ] Deduced a trap composed of 117 places in 618 ms of which 5 ms to minimize.
[2024-06-01 00:23:42] [INFO ] Deduced a trap composed of 71 places in 594 ms of which 5 ms to minimize.
[2024-06-01 00:23:43] [INFO ] Deduced a trap composed of 62 places in 673 ms of which 5 ms to minimize.
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 106 places in 614 ms of which 5 ms to minimize.
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 112 places in 648 ms of which 5 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 61 places in 611 ms of which 4 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 78 places in 583 ms of which 5 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 135 places in 565 ms of which 4 ms to minimize.
[2024-06-01 00:23:47] [INFO ] Deduced a trap composed of 114 places in 550 ms of which 4 ms to minimize.
[2024-06-01 00:23:48] [INFO ] Deduced a trap composed of 165 places in 550 ms of which 5 ms to minimize.
[2024-06-01 00:23:48] [INFO ] Deduced a trap composed of 85 places in 471 ms of which 4 ms to minimize.
[2024-06-01 00:23:49] [INFO ] Deduced a trap composed of 63 places in 537 ms of which 4 ms to minimize.
[2024-06-01 00:23:49] [INFO ] Deduced a trap composed of 144 places in 504 ms of which 4 ms to minimize.
[2024-06-01 00:23:50] [INFO ] Deduced a trap composed of 86 places in 465 ms of which 4 ms to minimize.
[2024-06-01 00:23:50] [INFO ] Deduced a trap composed of 57 places in 468 ms of which 3 ms to minimize.
[2024-06-01 00:23:51] [INFO ] Deduced a trap composed of 127 places in 441 ms of which 22 ms to minimize.
[2024-06-01 00:23:51] [INFO ] Deduced a trap composed of 88 places in 601 ms of which 5 ms to minimize.
[2024-06-01 00:23:52] [INFO ] Deduced a trap composed of 97 places in 572 ms of which 4 ms to minimize.
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 118 places in 551 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 00:23:55] [INFO ] Deduced a trap composed of 45 places in 667 ms of which 5 ms to minimize.
[2024-06-01 00:23:56] [INFO ] Deduced a trap composed of 101 places in 718 ms of which 5 ms to minimize.
[2024-06-01 00:23:57] [INFO ] Deduced a trap composed of 92 places in 626 ms of which 5 ms to minimize.
[2024-06-01 00:23:57] [INFO ] Deduced a trap composed of 112 places in 675 ms of which 7 ms to minimize.
SMT process timed out in 45669ms, After SMT, problems are : Problem set: 0 solved, 48 unsolved
Fused 48 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 1656/1656 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 239 transition count 940
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 239 transition count 940
Applied a total of 152 rules in 102 ms. Remains 239 /315 variables (removed 76) and now considering 940/1656 (removed 716) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 239/315 places, 940/1656 transitions.
RANDOM walk for 4000000 steps (8 resets) in 34487 ms. (115 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1205 ms. (331 steps per ms) remains 46/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1060 ms. (377 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (8 resets) in 853 ms. (468 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 886 ms. (450 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 863 ms. (462 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400001 steps (8 resets) in 914 ms. (437 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1110 ms. (360 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 959 ms. (416 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400003 steps (8 resets) in 860 ms. (464 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1126 ms. (354 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1166 ms. (342 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1227 ms. (325 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1241 ms. (322 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1116 ms. (358 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 915 ms. (436 steps per ms) remains 40/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 814 ms. (490 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (8 resets) in 810 ms. (493 steps per ms) remains 39/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 824 ms. (484 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1353 ms. (295 steps per ms) remains 38/39 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1472 ms. (271 steps per ms) remains 34/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1128 ms. (354 steps per ms) remains 31/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1186 ms. (336 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (8 resets) in 786 ms. (508 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 994 ms. (402 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400003 steps (8 resets) in 897 ms. (445 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 747 ms. (534 steps per ms) remains 25/29 properties
BEST_FIRST walk for 400001 steps (8 resets) in 698 ms. (572 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 713 ms. (560 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 711 ms. (561 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 747 ms. (534 steps per ms) remains 22/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 781 ms. (511 steps per ms) remains 21/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 752 ms. (531 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 702 ms. (568 steps per ms) remains 18/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 708 ms. (564 steps per ms) remains 18/18 properties
// Phase 1: matrix 940 rows 239 cols
[2024-06-01 00:24:17] [INFO ] Computed 20 invariants in 11 ms
[2024-06-01 00:24:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 174/193 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 44/237 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 00:24:18] [INFO ] Deduced a trap composed of 101 places in 295 ms of which 3 ms to minimize.
[2024-06-01 00:24:18] [INFO ] Deduced a trap composed of 94 places in 313 ms of which 3 ms to minimize.
[2024-06-01 00:24:18] [INFO ] Deduced a trap composed of 111 places in 340 ms of which 3 ms to minimize.
[2024-06-01 00:24:19] [INFO ] Deduced a trap composed of 76 places in 313 ms of which 4 ms to minimize.
[2024-06-01 00:24:19] [INFO ] Deduced a trap composed of 87 places in 362 ms of which 3 ms to minimize.
[2024-06-01 00:24:20] [INFO ] Deduced a trap composed of 104 places in 373 ms of which 4 ms to minimize.
[2024-06-01 00:24:20] [INFO ] Deduced a trap composed of 53 places in 413 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 00:24:20] [INFO ] Deduced a trap composed of 95 places in 289 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/239 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 00:24:21] [INFO ] Deduced a trap composed of 97 places in 391 ms of which 4 ms to minimize.
[2024-06-01 00:24:22] [INFO ] Deduced a trap composed of 86 places in 413 ms of which 4 ms to minimize.
[2024-06-01 00:24:22] [INFO ] Deduced a trap composed of 71 places in 401 ms of which 3 ms to minimize.
[2024-06-01 00:24:23] [INFO ] Deduced a trap composed of 35 places in 407 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 940/1179 variables, 239/271 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1179 variables, 72/343 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1179 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/1179 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1179/1179 variables, and 343 constraints, problems are : Problem set: 0 solved, 18 unsolved in 8637 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 239/239 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 174/193 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 44/237 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 00:24:26] [INFO ] Deduced a trap composed of 146 places in 313 ms of which 4 ms to minimize.
[2024-06-01 00:24:27] [INFO ] Deduced a trap composed of 84 places in 290 ms of which 3 ms to minimize.
[2024-06-01 00:24:27] [INFO ] Deduced a trap composed of 138 places in 395 ms of which 4 ms to minimize.
[2024-06-01 00:24:27] [INFO ] Deduced a trap composed of 76 places in 380 ms of which 3 ms to minimize.
[2024-06-01 00:24:28] [INFO ] Deduced a trap composed of 108 places in 369 ms of which 3 ms to minimize.
[2024-06-01 00:24:28] [INFO ] Deduced a trap composed of 132 places in 332 ms of which 3 ms to minimize.
[2024-06-01 00:24:28] [INFO ] Deduced a trap composed of 109 places in 281 ms of which 3 ms to minimize.
[2024-06-01 00:24:29] [INFO ] Deduced a trap composed of 119 places in 265 ms of which 3 ms to minimize.
[2024-06-01 00:24:29] [INFO ] Deduced a trap composed of 128 places in 309 ms of which 4 ms to minimize.
[2024-06-01 00:24:30] [INFO ] Deduced a trap composed of 90 places in 412 ms of which 4 ms to minimize.
[2024-06-01 00:24:30] [INFO ] Deduced a trap composed of 93 places in 379 ms of which 3 ms to minimize.
[2024-06-01 00:24:30] [INFO ] Deduced a trap composed of 127 places in 380 ms of which 3 ms to minimize.
[2024-06-01 00:24:31] [INFO ] Deduced a trap composed of 106 places in 357 ms of which 3 ms to minimize.
[2024-06-01 00:24:31] [INFO ] Deduced a trap composed of 73 places in 360 ms of which 3 ms to minimize.
[2024-06-01 00:24:31] [INFO ] Deduced a trap composed of 110 places in 287 ms of which 3 ms to minimize.
[2024-06-01 00:24:32] [INFO ] Deduced a trap composed of 56 places in 387 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 16/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 00:24:32] [INFO ] Deduced a trap composed of 75 places in 406 ms of which 4 ms to minimize.
[2024-06-01 00:24:33] [INFO ] Deduced a trap composed of 97 places in 455 ms of which 4 ms to minimize.
[2024-06-01 00:24:33] [INFO ] Deduced a trap composed of 85 places in 371 ms of which 4 ms to minimize.
[2024-06-01 00:24:34] [INFO ] Deduced a trap composed of 61 places in 398 ms of which 3 ms to minimize.
[2024-06-01 00:24:34] [INFO ] Deduced a trap composed of 87 places in 394 ms of which 4 ms to minimize.
[2024-06-01 00:24:35] [INFO ] Deduced a trap composed of 43 places in 345 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 00:24:35] [INFO ] Deduced a trap composed of 116 places in 339 ms of which 4 ms to minimize.
[2024-06-01 00:24:36] [INFO ] Deduced a trap composed of 81 places in 404 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 2/239 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 940/1179 variables, 239/295 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1179 variables, 72/367 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1179 variables, 18/385 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1179 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/1179 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1179/1179 variables, and 385 constraints, problems are : Problem set: 0 solved, 18 unsolved in 14526 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 239/239 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 36/36 constraints]
After SMT, in 23229ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 2 properties in 4594 ms.
Support contains 17 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 940/940 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 222 transition count 651
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 222 transition count 651
Applied a total of 34 rules in 45 ms. Remains 222 /239 variables (removed 17) and now considering 651/940 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 222/239 places, 651/940 transitions.
RANDOM walk for 4000000 steps (8 resets) in 25971 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 745 ms. (536 steps per ms) remains 14/16 properties
BEST_FIRST walk for 400003 steps (8 resets) in 890 ms. (448 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 767 ms. (520 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 569 ms. (701 steps per ms) remains 12/13 properties
BEST_FIRST walk for 400003 steps (8 resets) in 579 ms. (689 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (8 resets) in 546 ms. (731 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (8 resets) in 536 ms. (744 steps per ms) remains 11/12 properties
BEST_FIRST walk for 400003 steps (8 resets) in 533 ms. (749 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400004 steps (8 resets) in 524 ms. (761 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400002 steps (8 resets) in 518 ms. (770 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400004 steps (8 resets) in 528 ms. (756 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400004 steps (8 resets) in 527 ms. (757 steps per ms) remains 10/11 properties
BEST_FIRST walk for 400004 steps (8 resets) in 521 ms. (766 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400001 steps (8 resets) in 520 ms. (767 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 10/10 properties
// Phase 1: matrix 651 rows 222 cols
[2024-06-01 00:24:55] [INFO ] Computed 20 invariants in 8 ms
[2024-06-01 00:24:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 192/203 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/204 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 17/221 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:24:56] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/222 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:24:56] [INFO ] Deduced a trap composed of 91 places in 331 ms of which 4 ms to minimize.
[2024-06-01 00:24:57] [INFO ] Deduced a trap composed of 85 places in 351 ms of which 4 ms to minimize.
[2024-06-01 00:24:57] [INFO ] Deduced a trap composed of 50 places in 349 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 651/873 variables, 222/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 72/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/873 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 873/873 variables, and 318 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3431 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 222/222 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 192/203 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/204 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 17/221 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/222 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:24:59] [INFO ] Deduced a trap composed of 70 places in 348 ms of which 4 ms to minimize.
[2024-06-01 00:25:00] [INFO ] Deduced a trap composed of 56 places in 333 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 651/873 variables, 222/248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 72/320 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 10/330 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/873 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 873/873 variables, and 330 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3556 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 222/222 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 7025ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 3 properties in 8753 ms.
Support contains 8 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 651/651 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 214 transition count 515
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 214 transition count 515
Applied a total of 16 rules in 21 ms. Remains 214 /222 variables (removed 8) and now considering 515/651 (removed 136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 214/222 places, 515/651 transitions.
RANDOM walk for 4000000 steps (8 resets) in 13182 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 4169 ms. (959 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3887 ms. (1028 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4233 ms. (944 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 3470 ms. (1152 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3340 ms. (1197 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3534 ms. (1131 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1108480 steps (2 resets) in 765 ms. (1447 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 1692 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 192348 ms.
ITS solved all properties within timeout

BK_STOP 1717201522321

--------------------
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="Anderson-PT-09"
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 Anderson-PT-09, 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 r466-smll-171620124700222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-09.tgz
mv Anderson-PT-09 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 ;