fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r276-smll-171654415900062
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
872.640 401064.00 830990.00 966.50 T normal

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.r276-smll-171654415900062.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Parking-PT-864, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654415900062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 427K May 18 16:43 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 1716815121133

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 13:05:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-27 13:05:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 13:05:24] [INFO ] Load time of PNML (sax parser for PT used): 475 ms
[2024-05-27 13:05:24] [INFO ] Transformed 1185 places.
[2024-05-27 13:05:24] [INFO ] Transformed 1697 transitions.
[2024-05-27 13:05:24] [INFO ] Found NUPN structural information;
[2024-05-27 13:05:24] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 736 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1185/1185 places, 1697/1697 transitions.
Ensure Unique test removed 688 transitions
Reduce isomorphic transitions removed 688 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 720 rules applied. Total rules applied 720 place count 1185 transition count 977
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 752 place count 1153 transition count 977
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 752 place count 1153 transition count 945
Deduced a syphon composed of 32 places in 8 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 816 place count 1121 transition count 945
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 8 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 912 place count 1073 transition count 897
Applied a total of 912 rules in 328 ms. Remains 1073 /1185 variables (removed 112) and now considering 897/1697 (removed 800) transitions.
// Phase 1: matrix 897 rows 1073 cols
[2024-05-27 13:05:24] [INFO ] Computed 280 invariants in 60 ms
[2024-05-27 13:05:26] [INFO ] Implicit Places using invariants in 2110 ms returned [151, 158, 164, 170, 177, 184, 190, 196, 228, 230, 271, 278, 284, 290, 297, 304, 310, 316, 348, 350, 391, 398, 404, 410, 417, 424, 430, 436, 468, 470, 511, 518, 524, 530, 537, 544, 550, 556, 588, 590, 631, 638, 644, 650, 657, 664, 670, 676, 708, 710, 751, 758, 764, 770, 777, 784, 790, 796, 828, 830, 871, 878, 884, 890, 897, 904, 910, 916, 948, 950, 991, 998, 1004, 1010, 1017, 1024, 1030, 1036, 1068, 1070]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 2177 ms to find 80 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 993/1185 places, 897/1697 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 921 transition count 825
Applied a total of 144 rules in 39 ms. Remains 921 /993 variables (removed 72) and now considering 825/897 (removed 72) transitions.
// Phase 1: matrix 825 rows 921 cols
[2024-05-27 13:05:26] [INFO ] Computed 200 invariants in 12 ms
[2024-05-27 13:05:28] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2024-05-27 13:05:28] [INFO ] Invariant cache hit.
[2024-05-27 13:05:29] [INFO ] State equation strengthened by 344 read => feed constraints.
[2024-05-27 13:05:33] [INFO ] Implicit Places using invariants and state equation in 5657 ms returned []
Implicit Place search using SMT with State Equation took 7009 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 921/1185 places, 825/1697 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 9605 ms. Remains : 921/1185 places, 825/1697 transitions.
Discarding 288 transitions out of 825. Remains 537
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (155 resets) in 5922 ms. (6 steps per ms) remains 190/536 properties
BEST_FIRST walk for 404 steps (0 resets) in 12 ms. (31 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 12 ms. (31 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 14 ms. (26 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 12 ms. (31 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 12 ms. (31 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 17 ms. (22 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 190/190 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 190/190 properties
[2024-05-27 13:05:35] [INFO ] Invariant cache hit.
[2024-05-27 13:05:35] [INFO ] State equation strengthened by 344 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 365/365 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 522/887 variables, 183/548 constraints. Problems are: Problem set: 0 solved, 190 unsolved
SMT process timed out in 5266ms, After SMT, problems are : Problem set: 0 solved, 190 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 365 out of 921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 921/921 places, 825/825 transitions.
Free-agglomeration rule applied 89 times.
Iterating global reduction 0 with 89 rules applied. Total rules applied 89 place count 921 transition count 736
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 0 with 89 rules applied. Total rules applied 178 place count 832 transition count 736
Applied a total of 178 rules in 260 ms. Remains 832 /921 variables (removed 89) and now considering 736/825 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 832/921 places, 736/825 transitions.
RANDOM walk for 4000000 steps (16098 resets) in 117803 ms. (33 steps per ms) remains 120/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 120/120 properties
// Phase 1: matrix 736 rows 832 cols
[2024-05-27 13:06:14] [INFO ] Computed 200 invariants in 9 ms
[2024-05-27 13:06:14] [INFO ] State equation strengthened by 376 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 465/705 variables, 128/368 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 465/833 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 127/832 variables, 72/905 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 127/1032 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 736/1568 variables, 832/1864 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1568 variables, 376/2240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1568 variables, 0/2240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/1568 variables, 0/2240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1568/1568 variables, and 2240 constraints, problems are : Problem set: 0 solved, 120 unsolved in 45031 ms.
Refiners :[Domain max(s): 832/832 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 832/832 constraints, ReadFeed: 376/376 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 465/705 variables, 128/368 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 465/833 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 127/832 variables, 72/905 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 127/1032 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 736/1568 variables, 832/1864 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1568 variables, 376/2240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1568 variables, 120/2360 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1568 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1568/1568 variables, and 2360 constraints, problems are : Problem set: 0 solved, 120 unsolved in 45013 ms.
Refiners :[Domain max(s): 832/832 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 832/832 constraints, ReadFeed: 376/376 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 90157ms problems are : Problem set: 0 solved, 120 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 240 out of 832 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 832/832 places, 736/736 transitions.
Free-agglomeration rule applied 55 times.
Iterating global reduction 0 with 55 rules applied. Total rules applied 55 place count 832 transition count 681
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 110 place count 777 transition count 681
Applied a total of 110 rules in 85 ms. Remains 777 /832 variables (removed 55) and now considering 681/736 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 777/832 places, 681/736 transitions.
RANDOM walk for 4000000 steps (7607 resets) in 92503 ms. (43 steps per ms) remains 119/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 119/119 properties
Interrupted probabilistic random walk after 6424837 steps, run timeout after 78001 ms. (steps per millisecond=82 ) properties seen :72 out of 119
Probabilistic random walk after 6424837 steps, saw 687363 distinct states, run finished after 78014 ms. (steps per millisecond=82 ) properties seen :72
// Phase 1: matrix 681 rows 777 cols
[2024-05-27 13:09:29] [INFO ] Computed 200 invariants in 4 ms
[2024-05-27 13:09:29] [INFO ] State equation strengthened by 440 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 407/501 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 407/555 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 276/777 variables, 146/701 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 276/977 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 681/1458 variables, 777/1754 constraints. Problems are: Problem set: 0 solved, 47 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1458 variables, 440/2194 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1458 variables, 0/2194 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/1458 variables, 0/2194 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1458/1458 variables, and 2194 constraints, problems are : Problem set: 0 solved, 47 unsolved in 13216 ms.
Refiners :[Domain max(s): 777/777 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 777/777 constraints, ReadFeed: 440/440 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 407/501 variables, 54/148 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 407/555 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 276/777 variables, 146/701 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 276/977 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 681/1458 variables, 777/1754 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1458 variables, 440/2194 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1458 variables, 47/2241 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1458 variables, 0/2241 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/1458 variables, 0/2241 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1458/1458 variables, and 2241 constraints, problems are : Problem set: 0 solved, 47 unsolved in 21339 ms.
Refiners :[Domain max(s): 777/777 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 777/777 constraints, ReadFeed: 440/440 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 34612ms problems are : Problem set: 0 solved, 47 unsolved
Fused 47 Parikh solutions to 46 different solutions.
Parikh walk visited 0 properties in 11227 ms.
Support contains 94 out of 777 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 777/777 places, 681/681 transitions.
Free-agglomeration rule applied 73 times.
Iterating global reduction 0 with 73 rules applied. Total rules applied 73 place count 777 transition count 608
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 146 place count 704 transition count 608
Applied a total of 146 rules in 76 ms. Remains 704 /777 variables (removed 73) and now considering 608/681 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 704/777 places, 608/681 transitions.
RANDOM walk for 4000000 steps (8 resets) in 47518 ms. (84 steps per ms) remains 33/47 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2936 ms. (136 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3489 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2889 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3415 ms. (117 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2995 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2877 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3054 ms. (130 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3010 ms. (132 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2656 ms. (150 steps per ms) remains 29/31 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2925 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3103 ms. (128 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2888 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2836 ms. (140 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3260 ms. (122 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3134 ms. (127 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3145 ms. (127 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3068 ms. (130 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3327 ms. (120 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3318 ms. (120 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3718 ms. (107 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3561 ms. (112 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2955 ms. (135 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2759 ms. (144 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3017 ms. (132 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2967 ms. (134 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2897 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3015 ms. (132 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2895 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2782 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2687 ms. (148 steps per ms) remains 26/26 properties
// Phase 1: matrix 608 rows 704 cols
[2024-05-27 13:11:03] [INFO ] Computed 200 invariants in 5 ms
[2024-05-27 13:11:03] [INFO ] State equation strengthened by 513 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 407/459 variables, 33/85 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 407/492 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 245/704 variables, 167/659 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 245/904 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 608/1312 variables, 704/1608 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1312 variables, 513/2121 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1312 variables, 0/2121 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/1312 variables, 0/2121 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1312/1312 variables, and 2121 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5116 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 704/704 constraints, ReadFeed: 513/513 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 407/459 variables, 33/85 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 407/492 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 245/704 variables, 167/659 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 245/904 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 608/1312 variables, 704/1608 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1312 variables, 513/2121 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1312 variables, 26/2147 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1312 variables, 0/2147 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/1312 variables, 0/2147 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1312/1312 variables, and 2147 constraints, problems are : Problem set: 0 solved, 26 unsolved in 9229 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 704/704 constraints, ReadFeed: 513/513 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 14379ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 2 properties in 4933 ms.
Support contains 48 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 608/608 transitions.
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 704 transition count 585
Reduce places removed 23 places and 0 transitions.
Graph (complete) has 1392 edges and 681 vertex of which 606 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.2 ms
Discarding 75 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Iterating post reduction 0 with 24 rules applied. Total rules applied 47 place count 606 transition count 529
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 61 place count 606 transition count 515
Applied a total of 61 rules in 70 ms. Remains 606 /704 variables (removed 98) and now considering 515/608 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 606/704 places, 515/608 transitions.
RANDOM walk for 4000000 steps (8 resets) in 63815 ms. (62 steps per ms) remains 16/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2509 ms. (159 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2832 ms. (141 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2715 ms. (147 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2715 ms. (147 steps per ms) remains 12/13 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2577 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2497 ms. (160 steps per ms) remains 10/12 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2486 ms. (160 steps per ms) remains 9/10 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2486 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2665 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2804 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2837 ms. (140 steps per ms) remains 8/9 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2445 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2634 ms. (151 steps per ms) remains 8/8 properties
// Phase 1: matrix 515 rows 606 cols
[2024-05-27 13:11:53] [INFO ] Computed 182 invariants in 3 ms
[2024-05-27 13:11:53] [INFO ] State equation strengthened by 466 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 349/365 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 349/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 241/606 variables, 168/547 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/606 variables, 241/788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 515/1121 variables, 606/1394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1121 variables, 466/1860 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1121 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1121 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1121/1121 variables, and 1860 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1751 ms.
Refiners :[Domain max(s): 606/606 constraints, Positive P Invariants (semi-flows): 182/182 constraints, State Equation: 606/606 constraints, ReadFeed: 466/466 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 349/365 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 349/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 241/606 variables, 168/547 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/606 variables, 241/788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 515/1121 variables, 606/1394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1121 variables, 466/1860 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1121 variables, 8/1868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1121 variables, 0/1868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/1121 variables, 0/1868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1121/1121 variables, and 1868 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2507 ms.
Refiners :[Domain max(s): 606/606 constraints, Positive P Invariants (semi-flows): 182/182 constraints, State Equation: 606/606 constraints, ReadFeed: 466/466 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 4282ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 5 properties in 4174 ms.
Support contains 6 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 515/515 transitions.
Graph (complete) has 1234 edges and 606 vertex of which 450 are kept as prefixes of interest. Removing 156 places using SCC suffix rule.1 ms
Discarding 156 places :
Also discarding 120 output transitions
Drop transitions (Output transitions of discarded places.) removed 120 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 450 transition count 375
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 21 place count 450 transition count 367
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 37 place count 442 transition count 367
Free-agglomeration rule applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 50 place count 442 transition count 354
Reduce places removed 13 places and 0 transitions.
Graph (complete) has 849 edges and 429 vertex of which 348 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.0 ms
Discarding 81 places :
Also discarding 62 output transitions
Drop transitions (Output transitions of discarded places.) removed 62 transitions
Iterating post reduction 1 with 14 rules applied. Total rules applied 64 place count 348 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 72 place count 348 transition count 284
Applied a total of 72 rules in 33 ms. Remains 348 /606 variables (removed 258) and now considering 284/515 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 348/606 places, 284/515 transitions.
RANDOM walk for 1160 steps (0 resets) in 13 ms. (82 steps per ms) remains 0/3 properties
Able to resolve query QuasiLiveness after proving 537 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 398629 ms.
ITS solved all properties within timeout

BK_STOP 1716815522197

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="Parking-PT-864"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Parking-PT-864, 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 r276-smll-171654415900062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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