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-171620124200223.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-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620124200223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 927K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716264308356

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 04:05:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-21 04:05:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:05:10] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-21 04:05:10] [INFO ] Transformed 505 places.
[2024-05-21 04:05:10] [INFO ] Transformed 1845 transitions.
[2024-05-21 04:05:10] [INFO ] Found NUPN structural information;
[2024-05-21 04:05:10] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 458 ms.
RANDOM walk for 40000 steps (8 resets) in 3654 ms. (10 steps per ms) remains 56/505 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
// Phase 1: matrix 1845 rows 505 cols
[2024-05-21 04:05:12] [INFO ] Computed 21 invariants in 72 ms
[2024-05-21 04:05:12] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 432/481 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 432/490 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 9/490 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 9/500 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 15/505 variables, 11/511 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 15/526 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 1845/2350 variables, 505/1031 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2350 variables, 72/1103 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2350/2350 variables, and 1103 constraints, problems are : Problem set: 0 solved, 49 unsolved in 5067 ms.
Refiners :[Domain max(s): 505/505 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 505/505 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 432/481 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 432/490 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 9/490 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 9/500 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 15/505 variables, 11/511 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 15/526 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-21 04:05:20] [INFO ] Deduced a trap composed of 176 places in 652 ms of which 59 ms to minimize.
[2024-05-21 04:05:21] [INFO ] Deduced a trap composed of 122 places in 630 ms of which 7 ms to minimize.
[2024-05-21 04:05:22] [INFO ] Deduced a trap composed of 90 places in 579 ms of which 6 ms to minimize.
[2024-05-21 04:05:22] [INFO ] Deduced a trap composed of 165 places in 558 ms of which 15 ms to minimize.
[2024-05-21 04:05:23] [INFO ] Deduced a trap composed of 105 places in 545 ms of which 5 ms to minimize.
SMT process timed out in 10590ms, After SMT, problems are : Problem set: 0 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 27 Pre rules applied. Total rules applied 0 place count 505 transition count 1818
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 54 place count 478 transition count 1818
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 153 place count 379 transition count 567
Iterating global reduction 0 with 99 rules applied. Total rules applied 252 place count 379 transition count 567
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 0 with 90 rules applied. Total rules applied 342 place count 334 transition count 522
Applied a total of 342 rules in 231 ms. Remains 334 /505 variables (removed 171) and now considering 522/1845 (removed 1323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 334/505 places, 522/1845 transitions.
RANDOM walk for 4000000 steps (8 resets) in 31624 ms. (126 steps per ms) remains 35/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1415 ms. (282 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1422 ms. (281 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1380 ms. (289 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1388 ms. (287 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1400 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1404 ms. (284 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1413 ms. (282 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1410 ms. (283 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1405 ms. (284 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1349 ms. (296 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1358 ms. (294 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1353 ms. (295 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1329 ms. (300 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1314 ms. (304 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1311 ms. (304 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1311 ms. (304 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1316 ms. (303 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1319 ms. (303 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1302 ms. (306 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1320 ms. (302 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1303 ms. (306 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1314 ms. (304 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1317 ms. (303 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1309 ms. (305 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1311 ms. (304 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1305 ms. (306 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1300 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1312 ms. (304 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1312 ms. (304 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1305 ms. (306 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1309 ms. (305 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1309 ms. (305 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1309 ms. (305 steps per ms) remains 33/33 properties
// Phase 1: matrix 522 rows 334 cols
[2024-05-21 04:05:45] [INFO ] Computed 21 invariants in 11 ms
[2024-05-21 04:05:45] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 282/315 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 9/324 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 10/334 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 522/856 variables, 334/355 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/856 variables, 72/427 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/856 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/856 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 856/856 variables, and 427 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2300 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 334/334 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 282/315 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 04:05:47] [INFO ] Deduced a trap composed of 285 places in 192 ms of which 3 ms to minimize.
[2024-05-21 04:05:47] [INFO ] Deduced a trap composed of 285 places in 181 ms of which 3 ms to minimize.
[2024-05-21 04:05:48] [INFO ] Deduced a trap composed of 293 places in 184 ms of which 3 ms to minimize.
[2024-05-21 04:05:48] [INFO ] Deduced a trap composed of 281 places in 203 ms of which 4 ms to minimize.
[2024-05-21 04:05:48] [INFO ] Deduced a trap composed of 286 places in 242 ms of which 4 ms to minimize.
[2024-05-21 04:05:48] [INFO ] Deduced a trap composed of 285 places in 190 ms of which 3 ms to minimize.
[2024-05-21 04:05:49] [INFO ] Deduced a trap composed of 271 places in 243 ms of which 4 ms to minimize.
[2024-05-21 04:05:49] [INFO ] Deduced a trap composed of 269 places in 246 ms of which 4 ms to minimize.
[2024-05-21 04:05:49] [INFO ] Deduced a trap composed of 285 places in 238 ms of which 3 ms to minimize.
[2024-05-21 04:05:49] [INFO ] Deduced a trap composed of 277 places in 213 ms of which 3 ms to minimize.
[2024-05-21 04:05:50] [INFO ] Deduced a trap composed of 276 places in 225 ms of which 4 ms to minimize.
[2024-05-21 04:05:50] [INFO ] Deduced a trap composed of 292 places in 220 ms of which 3 ms to minimize.
[2024-05-21 04:05:50] [INFO ] Deduced a trap composed of 290 places in 184 ms of which 5 ms to minimize.
[2024-05-21 04:05:50] [INFO ] Deduced a trap composed of 280 places in 205 ms of which 4 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 285 places in 196 ms of which 4 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 285 places in 192 ms of which 3 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 280 places in 174 ms of which 4 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 284 places in 199 ms of which 4 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 282 places in 196 ms of which 3 ms to minimize.
[2024-05-21 04:05:52] [INFO ] Deduced a trap composed of 289 places in 181 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 04:05:52] [INFO ] Deduced a trap composed of 277 places in 197 ms of which 4 ms to minimize.
[2024-05-21 04:05:52] [INFO ] Deduced a trap composed of 283 places in 195 ms of which 3 ms to minimize.
[2024-05-21 04:05:52] [INFO ] Deduced a trap composed of 284 places in 192 ms of which 3 ms to minimize.
[2024-05-21 04:05:52] [INFO ] Deduced a trap composed of 282 places in 202 ms of which 3 ms to minimize.
[2024-05-21 04:05:53] [INFO ] Deduced a trap composed of 280 places in 198 ms of which 4 ms to minimize.
[2024-05-21 04:05:53] [INFO ] Deduced a trap composed of 276 places in 196 ms of which 4 ms to minimize.
[2024-05-21 04:05:53] [INFO ] Deduced a trap composed of 293 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 04:05:54] [INFO ] Deduced a trap composed of 283 places in 181 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 04:05:54] [INFO ] Deduced a trap composed of 295 places in 194 ms of which 4 ms to minimize.
[2024-05-21 04:05:54] [INFO ] Deduced a trap composed of 295 places in 182 ms of which 3 ms to minimize.
[2024-05-21 04:05:54] [INFO ] Deduced a trap composed of 287 places in 181 ms of which 3 ms to minimize.
[2024-05-21 04:05:55] [INFO ] Deduced a trap composed of 287 places in 194 ms of which 4 ms to minimize.
[2024-05-21 04:05:55] [INFO ] Deduced a trap composed of 277 places in 172 ms of which 4 ms to minimize.
[2024-05-21 04:05:55] [INFO ] Deduced a trap composed of 291 places in 189 ms of which 4 ms to minimize.
[2024-05-21 04:05:55] [INFO ] Deduced a trap composed of 275 places in 193 ms of which 4 ms to minimize.
[2024-05-21 04:05:55] [INFO ] Deduced a trap composed of 282 places in 199 ms of which 4 ms to minimize.
[2024-05-21 04:05:56] [INFO ] Deduced a trap composed of 276 places in 200 ms of which 4 ms to minimize.
[2024-05-21 04:05:56] [INFO ] Deduced a trap composed of 276 places in 200 ms of which 3 ms to minimize.
[2024-05-21 04:05:56] [INFO ] Deduced a trap composed of 278 places in 195 ms of which 4 ms to minimize.
[2024-05-21 04:05:56] [INFO ] Deduced a trap composed of 277 places in 198 ms of which 4 ms to minimize.
[2024-05-21 04:05:56] [INFO ] Deduced a trap composed of 282 places in 183 ms of which 4 ms to minimize.
[2024-05-21 04:05:57] [INFO ] Deduced a trap composed of 281 places in 191 ms of which 3 ms to minimize.
[2024-05-21 04:05:57] [INFO ] Deduced a trap composed of 277 places in 189 ms of which 4 ms to minimize.
[2024-05-21 04:05:57] [INFO ] Deduced a trap composed of 277 places in 193 ms of which 3 ms to minimize.
[2024-05-21 04:05:57] [INFO ] Deduced a trap composed of 278 places in 199 ms of which 3 ms to minimize.
[2024-05-21 04:05:57] [INFO ] Deduced a trap composed of 276 places in 176 ms of which 3 ms to minimize.
[2024-05-21 04:05:58] [INFO ] Deduced a trap composed of 277 places in 205 ms of which 3 ms to minimize.
[2024-05-21 04:05:58] [INFO ] Deduced a trap composed of 276 places in 190 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 9/324 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 10/334 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 04:05:59] [INFO ] Deduced a trap composed of 155 places in 284 ms of which 4 ms to minimize.
[2024-05-21 04:05:59] [INFO ] Deduced a trap composed of 214 places in 276 ms of which 4 ms to minimize.
[2024-05-21 04:05:59] [INFO ] Deduced a trap composed of 131 places in 285 ms of which 3 ms to minimize.
[2024-05-21 04:06:00] [INFO ] Deduced a trap composed of 190 places in 278 ms of which 3 ms to minimize.
[2024-05-21 04:06:00] [INFO ] Deduced a trap composed of 97 places in 264 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 522/856 variables, 334/408 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/856 variables, 72/480 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/856 variables, 33/513 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/856 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 0/856 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 856/856 variables, and 513 constraints, problems are : Problem set: 0 solved, 33 unsolved in 23853 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 334/334 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 53/53 constraints]
After SMT, in 26190ms problems are : Problem set: 0 solved, 33 unsolved
Parikh walk visited 0 properties in 443 ms.
Support contains 33 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 522/522 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 319 transition count 507
Applied a total of 30 rules in 45 ms. Remains 319 /334 variables (removed 15) and now considering 507/522 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 319/334 places, 507/522 transitions.
RANDOM walk for 4000000 steps (8 resets) in 26837 ms. (149 steps per ms) remains 29/33 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1220 ms. (327 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1220 ms. (327 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1221 ms. (327 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1220 ms. (327 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1234 ms. (323 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1231 ms. (324 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1205 ms. (331 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1206 ms. (331 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1205 ms. (331 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1248 ms. (320 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1206 ms. (331 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1220 ms. (327 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1203 ms. (332 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1200 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1209 ms. (330 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1214 ms. (329 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1207 ms. (331 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1199 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1194 ms. (334 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1175 ms. (340 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1200 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1204 ms. (331 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1199 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1209 ms. (330 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1209 ms. (330 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1204 ms. (331 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1205 ms. (331 steps per ms) remains 27/27 properties
// Phase 1: matrix 507 rows 319 cols
[2024-05-21 04:06:28] [INFO ] Computed 21 invariants in 7 ms
[2024-05-21 04:06:28] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 273/300 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 9/309 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 10/319 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 507/826 variables, 319/340 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/826 variables, 72/412 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/826 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/826 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 826/826 variables, and 412 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1849 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 319/319 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 273/300 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-21 04:06:31] [INFO ] Deduced a trap composed of 282 places in 196 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-21 04:06:31] [INFO ] Deduced a trap composed of 268 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 9/309 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 10/319 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 507/826 variables, 319/342 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/826 variables, 72/414 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/826 variables, 27/441 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/826 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 0/826 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 826/826 variables, and 441 constraints, problems are : Problem set: 0 solved, 27 unsolved in 4917 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 319/319 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 2/2 constraints]
After SMT, in 6792ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 0 properties in 957 ms.
Support contains 27 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 507/507 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 315 transition count 503
Applied a total of 8 rules in 46 ms. Remains 315 /319 variables (removed 4) and now considering 503/507 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 315/319 places, 503/507 transitions.
RANDOM walk for 4000000 steps (8 resets) in 25295 ms. (158 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1191 ms. (335 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1188 ms. (336 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1182 ms. (338 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1190 ms. (335 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1189 ms. (336 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1217 ms. (328 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1189 ms. (336 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1187 ms. (336 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1196 ms. (334 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1188 ms. (336 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1193 ms. (335 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1184 ms. (337 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1192 ms. (335 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1189 ms. (336 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1190 ms. (335 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1195 ms. (334 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1191 ms. (335 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1187 ms. (336 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1197 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1190 ms. (335 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1199 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1206 ms. (331 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1180 ms. (338 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1182 ms. (338 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1169 ms. (341 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1174 ms. (340 steps per ms) remains 24/24 properties
// Phase 1: matrix 503 rows 315 cols
[2024-05-21 04:06:53] [INFO ] Computed 21 invariants in 5 ms
[2024-05-21 04:06:53] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 272/296 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 9/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 10/315 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 503/818 variables, 315/336 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 72/408 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/818 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 408 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1643 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 315/315 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 272/296 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-21 04:06:55] [INFO ] Deduced a trap composed of 265 places in 204 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 9/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 10/315 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 503/818 variables, 315/337 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 72/409 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 24/433 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4536 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 315/315 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints]
After SMT, in 6202ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 0 properties in 322 ms.
Support contains 24 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 503/503 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 312 transition count 500
Applied a total of 6 rules in 23 ms. Remains 312 /315 variables (removed 3) and now considering 500/503 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 312/315 places, 500/503 transitions.
RANDOM walk for 4000000 steps (8 resets) in 26806 ms. (149 steps per ms) remains 23/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1297 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1312 ms. (304 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1317 ms. (303 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1318 ms. (303 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1312 ms. (304 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1311 ms. (304 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1315 ms. (303 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1318 ms. (303 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1329 ms. (300 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1318 ms. (303 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1314 ms. (304 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1326 ms. (301 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1307 ms. (305 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1345 ms. (297 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1319 ms. (303 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1308 ms. (305 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1319 ms. (303 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1309 ms. (305 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1294 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1286 ms. (310 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1274 ms. (313 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1253 ms. (318 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1254 ms. (318 steps per ms) remains 22/22 properties
Finished probabilistic random walk after 1611971 steps, run visited all 22 properties in 14666 ms. (steps per millisecond=109 )
Probabilistic random walk after 1611971 steps, saw 974556 distinct states, run finished after 14675 ms. (steps per millisecond=109 ) properties seen :22
Able to resolve query StableMarking after proving 505 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 143705 ms.
ITS solved all properties within timeout

BK_STOP 1716264453874

--------------------
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 StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-09"
export BK_EXAMINATION="StableMarking"
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-09, examination is StableMarking"
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-171620124200223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-09.tgz
mv Anderson-PT-09 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;