About the Execution of GreatSPN+red for Anderson-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2062.348 | 152922.00 | 293965.00 | 475.60 | 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.r012-smll-171620124100217.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 Anderson-PT-08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620124100217
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 667K 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 1716263770279
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 03:56:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-21 03:56:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:56:13] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2024-05-21 03:56:13] [INFO ] Transformed 401 places.
[2024-05-21 03:56:13] [INFO ] Transformed 1328 transitions.
[2024-05-21 03:56:13] [INFO ] Found NUPN structural information;
[2024-05-21 03:56:13] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 663 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 401 transition count 1272
Deduced a syphon composed of 56 places in 11 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 345 transition count 1272
Applied a total of 112 rules in 140 ms. Remains 345 /401 variables (removed 56) and now considering 1272/1328 (removed 56) transitions.
// Phase 1: matrix 1272 rows 345 cols
[2024-05-21 03:56:13] [INFO ] Computed 19 invariants in 91 ms
[2024-05-21 03:56:15] [INFO ] Implicit Places using invariants in 1874 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1944 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 344/401 places, 1272/1328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 344 transition count 1208
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 280 transition count 1208
Applied a total of 128 rules in 22 ms. Remains 280 /344 variables (removed 64) and now considering 1208/1272 (removed 64) transitions.
// Phase 1: matrix 1208 rows 280 cols
[2024-05-21 03:56:15] [INFO ] Computed 18 invariants in 10 ms
[2024-05-21 03:56:16] [INFO ] Implicit Places using invariants in 929 ms returned []
[2024-05-21 03:56:16] [INFO ] Invariant cache hit.
[2024-05-21 03:56:17] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-21 03:56:19] [INFO ] Implicit Places using invariants and state equation in 3270 ms returned []
Implicit Place search using SMT with State Equation took 4214 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 280/401 places, 1208/1328 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 6375 ms. Remains : 280/401 places, 1208/1328 transitions.
Initial state reduction rules removed 8 formulas.
RANDOM walk for 40000 steps (8 resets) in 4805 ms. (8 steps per ms) remains 466/1200 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 466/466 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 466/466 properties
[2024-05-21 03:56:21] [INFO ] Invariant cache hit.
[2024-05-21 03:56:21] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 466 unsolved
(s69 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 163/280 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 6683ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 1208/1208 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 249 transition count 1177
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 249 transition count 1177
Applied a total of 62 rules in 118 ms. Remains 249 /280 variables (removed 31) and now considering 1177/1208 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 249/280 places, 1177/1208 transitions.
RANDOM walk for 4000000 steps (8 resets) in 80321 ms. (49 steps per ms) remains 107/466 properties
BEST_FIRST walk for 40002 steps (8 resets) in 194 ms. (205 steps per ms) remains 98/107 properties
BEST_FIRST walk for 40002 steps (8 resets) in 183 ms. (217 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40001 steps (8 resets) in 237 ms. (168 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 95/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 284 ms. (140 steps per ms) remains 83/95 properties
BEST_FIRST walk for 40001 steps (8 resets) in 179 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 81/83 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 78/81 properties
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 77/78 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 77/77 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 77/77 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 74/77 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 71/74 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 69/71 properties
BEST_FIRST walk for 40001 steps (8 resets) in 130 ms. (305 steps per ms) remains 68/69 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40001 steps (8 resets) in 117 ms. (338 steps per ms) remains 67/68 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 67/67 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 67/67 properties
BEST_FIRST walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 67/67 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 64/67 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 60/64 properties
BEST_FIRST walk for 40001 steps (8 resets) in 125 ms. (317 steps per ms) remains 58/60 properties
BEST_FIRST walk for 40001 steps (8 resets) in 115 ms. (344 steps per ms) remains 58/58 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 58/58 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 58/58 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 58/58 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 52/58 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 51/52 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 50/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 50/50 properties
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 50/50 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 50/50 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 50/50 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 50/50 properties
BEST_FIRST walk for 40002 steps (8 resets) in 139 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 49/50 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 47/49 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 46/47 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 44/46 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 44/44 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 44/44 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 44/44 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 44/44 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 44/44 properties
BEST_FIRST walk for 40001 steps (8 resets) in 92 ms. (430 steps per ms) remains 40/44 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 40/40 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 38/40 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 33/38 properties
// Phase 1: matrix 1177 rows 249 cols
[2024-05-21 03:56:51] [INFO ] Computed 18 invariants in 10 ms
[2024-05-21 03:56:51] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 202/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 21/248 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 03:56:52] [INFO ] Deduced a trap composed of 130 places in 327 ms of which 31 ms to minimize.
[2024-05-21 03:56:53] [INFO ] Deduced a trap composed of 77 places in 382 ms of which 4 ms to minimize.
[2024-05-21 03:56:53] [INFO ] Deduced a trap composed of 91 places in 331 ms of which 3 ms to minimize.
[2024-05-21 03:56:53] [INFO ] Deduced a trap composed of 98 places in 290 ms of which 3 ms to minimize.
[2024-05-21 03:56:54] [INFO ] Deduced a trap composed of 50 places in 295 ms of which 3 ms to minimize.
[2024-05-21 03:56:54] [INFO ] Deduced a trap composed of 79 places in 332 ms of which 4 ms to minimize.
[2024-05-21 03:56:54] [INFO ] Deduced a trap composed of 129 places in 354 ms of which 4 ms to minimize.
[2024-05-21 03:56:55] [INFO ] Deduced a trap composed of 87 places in 382 ms of which 5 ms to minimize.
[2024-05-21 03:56:55] [INFO ] Deduced a trap composed of 61 places in 509 ms of which 5 ms to minimize.
[2024-05-21 03:56:56] [INFO ] Deduced a trap composed of 51 places in 369 ms of which 4 ms to minimize.
[2024-05-21 03:56:56] [INFO ] Deduced a trap composed of 89 places in 396 ms of which 4 ms to minimize.
[2024-05-21 03:56:56] [INFO ] Deduced a trap composed of 81 places in 402 ms of which 3 ms to minimize.
[2024-05-21 03:56:57] [INFO ] Deduced a trap composed of 85 places in 359 ms of which 3 ms to minimize.
[2024-05-21 03:56:57] [INFO ] Deduced a trap composed of 97 places in 522 ms of which 4 ms to minimize.
[2024-05-21 03:56:58] [INFO ] Deduced a trap composed of 94 places in 392 ms of which 3 ms to minimize.
[2024-05-21 03:56:58] [INFO ] Deduced a trap composed of 78 places in 382 ms of which 3 ms to minimize.
[2024-05-21 03:56:59] [INFO ] Deduced a trap composed of 62 places in 515 ms of which 4 ms to minimize.
[2024-05-21 03:56:59] [INFO ] Deduced a trap composed of 113 places in 509 ms of which 4 ms to minimize.
[2024-05-21 03:57:00] [INFO ] Deduced a trap composed of 93 places in 378 ms of which 3 ms to minimize.
[2024-05-21 03:57:00] [INFO ] Deduced a trap composed of 100 places in 324 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 03:57:01] [INFO ] Deduced a trap composed of 43 places in 426 ms of which 4 ms to minimize.
[2024-05-21 03:57:01] [INFO ] Deduced a trap composed of 87 places in 385 ms of which 3 ms to minimize.
[2024-05-21 03:57:01] [INFO ] Deduced a trap composed of 103 places in 376 ms of which 3 ms to minimize.
[2024-05-21 03:57:02] [INFO ] Deduced a trap composed of 73 places in 434 ms of which 4 ms to minimize.
[2024-05-21 03:57:02] [INFO ] Deduced a trap composed of 69 places in 473 ms of which 5 ms to minimize.
[2024-05-21 03:57:03] [INFO ] Deduced a trap composed of 70 places in 475 ms of which 5 ms to minimize.
[2024-05-21 03:57:03] [INFO ] Deduced a trap composed of 94 places in 466 ms of which 5 ms to minimize.
[2024-05-21 03:57:04] [INFO ] Deduced a trap composed of 68 places in 454 ms of which 4 ms to minimize.
[2024-05-21 03:57:04] [INFO ] Deduced a trap composed of 63 places in 476 ms of which 4 ms to minimize.
[2024-05-21 03:57:05] [INFO ] Deduced a trap composed of 104 places in 383 ms of which 3 ms to minimize.
[2024-05-21 03:57:05] [INFO ] Deduced a trap composed of 75 places in 371 ms of which 3 ms to minimize.
[2024-05-21 03:57:06] [INFO ] Deduced a trap composed of 67 places in 475 ms of which 4 ms to minimize.
[2024-05-21 03:57:06] [INFO ] Deduced a trap composed of 55 places in 356 ms of which 3 ms to minimize.
[2024-05-21 03:57:06] [INFO ] Deduced a trap composed of 112 places in 461 ms of which 5 ms to minimize.
[2024-05-21 03:57:07] [INFO ] Deduced a trap composed of 79 places in 385 ms of which 5 ms to minimize.
[2024-05-21 03:57:07] [INFO ] Deduced a trap composed of 101 places in 461 ms of which 5 ms to minimize.
[2024-05-21 03:57:08] [INFO ] Deduced a trap composed of 67 places in 475 ms of which 5 ms to minimize.
[2024-05-21 03:57:08] [INFO ] Deduced a trap composed of 60 places in 472 ms of which 5 ms to minimize.
[2024-05-21 03:57:09] [INFO ] Deduced a trap composed of 60 places in 469 ms of which 4 ms to minimize.
[2024-05-21 03:57:09] [INFO ] Deduced a trap composed of 129 places in 410 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 03:57:10] [INFO ] Deduced a trap composed of 55 places in 496 ms of which 5 ms to minimize.
[2024-05-21 03:57:10] [INFO ] Deduced a trap composed of 83 places in 408 ms of which 4 ms to minimize.
[2024-05-21 03:57:11] [INFO ] Deduced a trap composed of 90 places in 387 ms of which 4 ms to minimize.
[2024-05-21 03:57:11] [INFO ] Deduced a trap composed of 76 places in 406 ms of which 4 ms to minimize.
[2024-05-21 03:57:12] [INFO ] Deduced a trap composed of 38 places in 396 ms of which 4 ms to minimize.
[2024-05-21 03:57:12] [INFO ] Deduced a trap composed of 112 places in 425 ms of which 4 ms to minimize.
[2024-05-21 03:57:12] [INFO ] Deduced a trap composed of 76 places in 418 ms of which 4 ms to minimize.
[2024-05-21 03:57:13] [INFO ] Deduced a trap composed of 101 places in 369 ms of which 4 ms to minimize.
[2024-05-21 03:57:13] [INFO ] Deduced a trap composed of 58 places in 370 ms of which 3 ms to minimize.
[2024-05-21 03:57:14] [INFO ] Deduced a trap composed of 60 places in 405 ms of which 4 ms to minimize.
[2024-05-21 03:57:14] [INFO ] Deduced a trap composed of 117 places in 379 ms of which 4 ms to minimize.
[2024-05-21 03:57:14] [INFO ] Deduced a trap composed of 80 places in 380 ms of which 3 ms to minimize.
[2024-05-21 03:57:15] [INFO ] Deduced a trap composed of 83 places in 367 ms of which 4 ms to minimize.
[2024-05-21 03:57:15] [INFO ] Deduced a trap composed of 93 places in 372 ms of which 3 ms to minimize.
[2024-05-21 03:57:16] [INFO ] Deduced a trap composed of 71 places in 330 ms of which 3 ms to minimize.
[2024-05-21 03:57:16] [INFO ] Deduced a trap composed of 85 places in 354 ms of which 4 ms to minimize.
[2024-05-21 03:57:16] [INFO ] Deduced a trap composed of 82 places in 472 ms of which 5 ms to minimize.
[2024-05-21 03:57:17] [INFO ] Deduced a trap composed of 71 places in 483 ms of which 4 ms to minimize.
[2024-05-21 03:57:18] [INFO ] Deduced a trap composed of 75 places in 478 ms of which 4 ms to minimize.
[2024-05-21 03:57:18] [INFO ] Deduced a trap composed of 73 places in 487 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 03:57:21] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 3 ms to minimize.
[2024-05-21 03:57:21] [INFO ] Deduced a trap composed of 41 places in 356 ms of which 3 ms to minimize.
[2024-05-21 03:57:22] [INFO ] Deduced a trap composed of 74 places in 302 ms of which 3 ms to minimize.
[2024-05-21 03:57:22] [INFO ] Deduced a trap composed of 55 places in 401 ms of which 5 ms to minimize.
[2024-05-21 03:57:23] [INFO ] Deduced a trap composed of 113 places in 404 ms of which 4 ms to minimize.
[2024-05-21 03:57:23] [INFO ] Deduced a trap composed of 67 places in 354 ms of which 4 ms to minimize.
[2024-05-21 03:57:23] [INFO ] Deduced a trap composed of 79 places in 402 ms of which 4 ms to minimize.
[2024-05-21 03:57:24] [INFO ] Deduced a trap composed of 90 places in 368 ms of which 4 ms to minimize.
[2024-05-21 03:57:24] [INFO ] Deduced a trap composed of 68 places in 466 ms of which 4 ms to minimize.
[2024-05-21 03:57:25] [INFO ] Deduced a trap composed of 101 places in 379 ms of which 3 ms to minimize.
[2024-05-21 03:57:25] [INFO ] Deduced a trap composed of 62 places in 389 ms of which 4 ms to minimize.
[2024-05-21 03:57:26] [INFO ] Deduced a trap composed of 96 places in 391 ms of which 3 ms to minimize.
[2024-05-21 03:57:26] [INFO ] Deduced a trap composed of 117 places in 472 ms of which 5 ms to minimize.
[2024-05-21 03:57:27] [INFO ] Deduced a trap composed of 57 places in 480 ms of which 4 ms to minimize.
[2024-05-21 03:57:28] [INFO ] Deduced a trap composed of 100 places in 402 ms of which 3 ms to minimize.
[2024-05-21 03:57:28] [INFO ] Deduced a trap composed of 79 places in 478 ms of which 4 ms to minimize.
[2024-05-21 03:57:28] [INFO ] Deduced a trap composed of 105 places in 469 ms of which 5 ms to minimize.
[2024-05-21 03:57:29] [INFO ] Deduced a trap composed of 67 places in 470 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 18/95 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 03:57:31] [INFO ] Deduced a trap composed of 65 places in 482 ms of which 4 ms to minimize.
[2024-05-21 03:57:32] [INFO ] Deduced a trap composed of 78 places in 381 ms of which 3 ms to minimize.
[2024-05-21 03:57:32] [INFO ] Deduced a trap composed of 84 places in 383 ms of which 3 ms to minimize.
[2024-05-21 03:57:33] [INFO ] Deduced a trap composed of 55 places in 468 ms of which 4 ms to minimize.
[2024-05-21 03:57:33] [INFO ] Deduced a trap composed of 99 places in 477 ms of which 5 ms to minimize.
[2024-05-21 03:57:34] [INFO ] Deduced a trap composed of 81 places in 480 ms of which 4 ms to minimize.
[2024-05-21 03:57:34] [INFO ] Deduced a trap composed of 91 places in 485 ms of which 5 ms to minimize.
[2024-05-21 03:57:35] [INFO ] Deduced a trap composed of 69 places in 382 ms of which 3 ms to minimize.
[2024-05-21 03:57:36] [INFO ] Deduced a trap composed of 65 places in 469 ms of which 5 ms to minimize.
[2024-05-21 03:57:36] [INFO ] Deduced a trap composed of 44 places in 442 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 248/1426 variables, and 105 constraints, problems are : Problem set: 0 solved, 33 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/249 constraints, ReadFeed: 0/81 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 202/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 21/248 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 88/105 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 03:57:38] [INFO ] Deduced a trap composed of 75 places in 474 ms of which 5 ms to minimize.
[2024-05-21 03:57:39] [INFO ] Deduced a trap composed of 81 places in 531 ms of which 4 ms to minimize.
[2024-05-21 03:57:40] [INFO ] Deduced a trap composed of 49 places in 518 ms of which 4 ms to minimize.
[2024-05-21 03:57:40] [INFO ] Deduced a trap composed of 102 places in 387 ms of which 3 ms to minimize.
[2024-05-21 03:57:41] [INFO ] Deduced a trap composed of 59 places in 427 ms of which 3 ms to minimize.
[2024-05-21 03:57:41] [INFO ] Deduced a trap composed of 69 places in 531 ms of which 4 ms to minimize.
[2024-05-21 03:57:42] [INFO ] Deduced a trap composed of 86 places in 416 ms of which 3 ms to minimize.
[2024-05-21 03:57:42] [INFO ] Deduced a trap composed of 39 places in 382 ms of which 3 ms to minimize.
[2024-05-21 03:57:43] [INFO ] Deduced a trap composed of 58 places in 442 ms of which 5 ms to minimize.
[2024-05-21 03:57:43] [INFO ] Deduced a trap composed of 59 places in 516 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 03:57:49] [INFO ] Deduced a trap composed of 74 places in 425 ms of which 3 ms to minimize.
[2024-05-21 03:57:49] [INFO ] Deduced a trap composed of 128 places in 507 ms of which 5 ms to minimize.
[2024-05-21 03:57:50] [INFO ] Deduced a trap composed of 90 places in 471 ms of which 3 ms to minimize.
[2024-05-21 03:57:50] [INFO ] Deduced a trap composed of 87 places in 467 ms of which 5 ms to minimize.
[2024-05-21 03:57:51] [INFO ] Deduced a trap composed of 82 places in 489 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 03:57:55] [INFO ] Deduced a trap composed of 86 places in 272 ms of which 3 ms to minimize.
[2024-05-21 03:57:56] [INFO ] Deduced a trap composed of 95 places in 331 ms of which 3 ms to minimize.
[2024-05-21 03:57:57] [INFO ] Deduced a trap composed of 74 places in 505 ms of which 4 ms to minimize.
[2024-05-21 03:57:57] [INFO ] Deduced a trap composed of 69 places in 470 ms of which 4 ms to minimize.
[2024-05-21 03:57:58] [INFO ] Deduced a trap composed of 74 places in 372 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 1/249 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 1177/1426 variables, 249/375 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1426 variables, 81/456 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1426 variables, 33/489 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1426 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (OVERLAPS) 0/1426 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1426/1426 variables, and 489 constraints, problems are : Problem set: 0 solved, 33 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 249/249 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 108/108 constraints]
After SMT, in 90159ms problems are : Problem set: 0 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 1177/1177 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 191 transition count 657
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 191 transition count 657
Applied a total of 116 rules in 54 ms. Remains 191 /249 variables (removed 58) and now considering 657/1177 (removed 520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 191/249 places, 657/1177 transitions.
RANDOM walk for 4000000 steps (8 resets) in 23672 ms. (168 steps per ms) remains 30/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 764 ms. (522 steps per ms) remains 28/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1463 ms. (273 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1742 ms. (229 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1272 ms. (314 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1198 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1337 ms. (298 steps per ms) remains 22/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1364 ms. (293 steps per ms) remains 20/22 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1391 ms. (287 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1294 ms. (308 steps per ms) remains 17/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1281 ms. (312 steps per ms) remains 15/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1177 ms. (339 steps per ms) remains 13/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1187 ms. (336 steps per ms) remains 12/13 properties
BEST_FIRST walk for 400004 steps (8 resets) in 873 ms. (457 steps per ms) remains 10/12 properties
BEST_FIRST walk for 400002 steps (8 resets) in 944 ms. (423 steps per ms) remains 9/10 properties
BEST_FIRST walk for 400003 steps (8 resets) in 862 ms. (463 steps per ms) remains 8/9 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1113 ms. (359 steps per ms) remains 6/8 properties
BEST_FIRST walk for 400003 steps (8 resets) in 867 ms. (460 steps per ms) remains 4/6 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1030 ms. (387 steps per ms) remains 3/4 properties
BEST_FIRST walk for 400003 steps (8 resets) in 976 ms. (409 steps per ms) remains 2/3 properties
BEST_FIRST walk for 400002 steps (8 resets) in 804 ms. (496 steps per ms) remains 1/2 properties
// Phase 1: matrix 657 rows 191 cols
[2024-05-21 03:58:39] [INFO ] Computed 18 invariants in 6 ms
[2024-05-21 03:58:39] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/167 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/191 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 657/848 variables, 191/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 56/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/848 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 848/848 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 191/191 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/167 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/191 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:58:40] [INFO ] Deduced a trap composed of 80 places in 239 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 657/848 variables, 191/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 56/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/848 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 848/848 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 191/191 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1327ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 657/657 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 169 transition count 327
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 169 transition count 327
Applied a total of 44 rules in 31 ms. Remains 169 /191 variables (removed 22) and now considering 327/657 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 169/191 places, 327/657 transitions.
RANDOM walk for 4000000 steps (8 resets) in 7220 ms. (553 steps per ms) remains 1/1 properties
BEST_FIRST walk for 735276 steps (1 resets) in 572 ms. (1283 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 1208 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 150619 ms.
ITS solved all properties within timeout
BK_STOP 1716263923201
--------------------
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-08"
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 Anderson-PT-08, 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 r012-smll-171620124100217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-08.tgz
mv Anderson-PT-08 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 '
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 ;