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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717244727663

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:25:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 12:25:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:25:30] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2024-06-01 12:25:30] [INFO ] Transformed 480 places.
[2024-06-01 12:25:30] [INFO ] Transformed 690 transitions.
[2024-06-01 12:25:30] [INFO ] Found NUPN structural information;
[2024-06-01 12:25:30] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 416 ms.
RANDOM walk for 40000 steps (8 resets) in 2683 ms. (14 steps per ms) remains 220/480 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
[2024-06-01 12:25:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 12:25:31] [INFO ] Computed 19 invariants in 28 ms
[2024-06-01 12:25:31] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 230/450 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 230/455 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/1110 variables, and 455 constraints, problems are : Problem set: 0 solved, 220 unsolved in 5087 ms.
Refiners :[Domain max(s): 450/480 constraints, Positive P Invariants (semi-flows): 5/14 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 230/450 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 230/455 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/1110 variables, and 455 constraints, problems are : Problem set: 0 solved, 220 unsolved in 5023 ms.
Refiners :[Domain max(s): 450/480 constraints, Positive P Invariants (semi-flows): 5/14 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 10308ms problems are : Problem set: 0 solved, 220 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 220 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 480 transition count 608
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 398 transition count 608
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 164 place count 398 transition count 549
Deduced a syphon composed of 59 places in 4 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 282 place count 339 transition count 549
Applied a total of 282 rules in 143 ms. Remains 339 /480 variables (removed 141) and now considering 549/690 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 339/480 places, 549/690 transitions.
RANDOM walk for 4000000 steps (8 resets) in 70594 ms. (56 steps per ms) remains 216/220 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 215/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 212/215 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 208/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 204/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 200/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 200/200 properties
Interrupted probabilistic random walk after 6306804 steps, run timeout after 66001 ms. (steps per millisecond=95 ) properties seen :55 out of 200
Probabilistic random walk after 6306804 steps, saw 1051333 distinct states, run finished after 66016 ms. (steps per millisecond=95 ) properties seen :55
[2024-06-01 12:27:10] [INFO ] Flow matrix only has 489 transitions (discarded 60 similar events)
// Phase 1: matrix 489 rows 339 cols
[2024-06-01 12:27:10] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 12:27:10] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 110/255 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 110/259 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 4/259 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 4/263 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 399/662 variables, 263/538 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 72/610 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 36/698 variables, 20/630 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/698 variables, 20/650 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/698 variables, 4/654 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/698 variables, 4/658 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/698 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 19 (OVERLAPS) 40/738 variables, 8/666 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/738 variables, 8/674 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/738 variables, 40/714 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/738 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 23 (OVERLAPS) 46/784 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/784 variables, 46/761 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/784 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 26 (OVERLAPS) 1/785 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/785 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/785 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 29 (OVERLAPS) 1/786 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/786 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/786 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 32 (OVERLAPS) 42/828 variables, 48/813 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/828 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 (/ 53.0 98.0))
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/828 variables, and 813 constraints, problems are : Problem set: 0 solved, 145 unsolved in 45014 ms.
Refiners :[Domain max(s): 339/339 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 339/339 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 110/255 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 110/259 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 4/259 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 4/263 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 31 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 80 places in 178 ms of which 3 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 3 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 115 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 399/662 variables, 263/544 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 72/616 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/662 variables, 135/751 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/662 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (OVERLAPS) 36/698 variables, 20/771 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/698 variables, 20/791 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/698 variables, 4/795 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/698 variables, 4/799 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 12:28:19] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 5 ms to minimize.
[2024-06-01 12:28:20] [INFO ] Deduced a trap composed of 50 places in 267 ms of which 5 ms to minimize.
[2024-06-01 12:28:20] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 3 ms to minimize.
[2024-06-01 12:28:20] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 4 ms to minimize.
[2024-06-01 12:28:20] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 2 ms to minimize.
[2024-06-01 12:28:20] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 4 ms to minimize.
[2024-06-01 12:28:21] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-06-01 12:28:21] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-06-01 12:28:21] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-06-01 12:28:21] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 3 ms to minimize.
[2024-06-01 12:28:21] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 4 ms to minimize.
[2024-06-01 12:28:22] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 3 ms to minimize.
[2024-06-01 12:28:22] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 3 ms to minimize.
[2024-06-01 12:28:22] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 3 ms to minimize.
[2024-06-01 12:28:22] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 3 ms to minimize.
[2024-06-01 12:28:22] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 3 ms to minimize.
[2024-06-01 12:28:23] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 3 ms to minimize.
[2024-06-01 12:28:23] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 3 ms to minimize.
[2024-06-01 12:28:23] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 3 ms to minimize.
[2024-06-01 12:28:23] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/698 variables, 20/819 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 12:28:28] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2024-06-01 12:28:28] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:28:29] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:28:29] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:28:29] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 3 ms to minimize.
[2024-06-01 12:28:29] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 3 ms to minimize.
[2024-06-01 12:28:29] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 3 ms to minimize.
[2024-06-01 12:28:29] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:28:30] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:28:30] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 3 ms to minimize.
[2024-06-01 12:28:30] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 3 ms to minimize.
[2024-06-01 12:28:30] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 3 ms to minimize.
[2024-06-01 12:28:30] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 3 ms to minimize.
[2024-06-01 12:28:30] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 3 ms to minimize.
[2024-06-01 12:28:31] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 4 ms to minimize.
[2024-06-01 12:28:31] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 3 ms to minimize.
[2024-06-01 12:28:31] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:28:31] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:28:32] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:28:32] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/698 variables, 20/839 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 12:28:38] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 2 ms to minimize.
[2024-06-01 12:28:38] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 3 ms to minimize.
[2024-06-01 12:28:39] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 3 ms to minimize.
[2024-06-01 12:28:39] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-06-01 12:28:39] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 3 ms to minimize.
[2024-06-01 12:28:39] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:28:40] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/828 variables, and 846 constraints, problems are : Problem set: 0 solved, 145 unsolved in 45017 ms.
Refiners :[Domain max(s): 283/339 constraints, Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 4/5 constraints, State Equation: 283/339 constraints, ReadFeed: 76/116 constraints, PredecessorRefiner: 135/145 constraints, Known Traps: 53/53 constraints]
After SMT, in 90082ms problems are : Problem set: 0 solved, 145 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 145 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 549/549 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 339 transition count 515
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 305 transition count 515
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 68 place count 305 transition count 498
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 102 place count 288 transition count 498
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 281 transition count 491
Applied a total of 116 rules in 53 ms. Remains 281 /339 variables (removed 58) and now considering 491/549 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 281/339 places, 491/549 transitions.
RANDOM walk for 4000000 steps (8 resets) in 52487 ms. (76 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 138/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 138/138 properties
Interrupted probabilistic random walk after 5173506 steps, run timeout after 45001 ms. (steps per millisecond=114 ) properties seen :39 out of 138
Probabilistic random walk after 5173506 steps, saw 862532 distinct states, run finished after 45007 ms. (steps per millisecond=114 ) properties seen :39
[2024-06-01 12:29:40] [INFO ] Flow matrix only has 431 transitions (discarded 60 similar events)
// Phase 1: matrix 431 rows 281 cols
[2024-06-01 12:29:40] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 12:29:40] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 93/192 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 93/195 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 3/195 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 3/198 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 300/498 variables, 198/405 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 48/453 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (OVERLAPS) 52/550 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/550 variables, 20/493 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 18 (OVERLAPS) 80/630 variables, 16/513 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/630 variables, 16/529 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/630 variables, 68/597 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/630 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 22 (OVERLAPS) 43/673 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/673 variables, 43/642 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/673 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 25 (OVERLAPS) 2/675 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/675 variables, 2/646 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/675 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 28 (OVERLAPS) 2/677 variables, 2/648 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/677 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/677 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 31 (OVERLAPS) 35/712 variables, 47/697 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/712 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 33 (OVERLAPS) 0/712 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 712/712 variables, and 697 constraints, problems are : Problem set: 0 solved, 99 unsolved in 30136 ms.
Refiners :[Domain max(s): 281/281 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 281/281 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 93/192 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 93/195 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 3/195 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 3/198 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:30:13] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 3 ms to minimize.
[2024-06-01 12:30:13] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:30:14] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 300/498 variables, 198/408 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 48/456 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/498 variables, 96/552 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (OVERLAPS) 52/550 variables, 20/572 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 20/592 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 4/596 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:30:22] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 7 ms to minimize.
[2024-06-01 12:30:23] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 4 ms to minimize.
[2024-06-01 12:30:23] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 3 ms to minimize.
[2024-06-01 12:30:23] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:30:23] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:30:23] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:30:24] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 3 ms to minimize.
[2024-06-01 12:30:24] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 4 ms to minimize.
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 9/605 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/550 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 21 (OVERLAPS) 80/630 variables, 16/621 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/630 variables, 16/637 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/630 variables, 68/705 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 3 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 4 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 3 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-06-01 12:30:35] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 3 ms to minimize.
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 3 ms to minimize.
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 4 ms to minimize.
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 4 ms to minimize.
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 3 ms to minimize.
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 3 ms to minimize.
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:30:37] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:30:38] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 3 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:30:39] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/630 variables, 19/724 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:30:43] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:30:44] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:30:45] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/630 variables, 3/727 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/630 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 27 (OVERLAPS) 43/673 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/673 variables, 43/772 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:30:59] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 5 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 4 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 4 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 3 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 3 ms to minimize.
[2024-06-01 12:31:00] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 3 ms to minimize.
[2024-06-01 12:31:01] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 4 ms to minimize.
[2024-06-01 12:31:02] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 4 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 3 ms to minimize.
[2024-06-01 12:31:03] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 3 ms to minimize.
[2024-06-01 12:31:04] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 4 ms to minimize.
[2024-06-01 12:31:04] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/673 variables, 20/792 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:31:09] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:31:11] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-06-01 12:31:11] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 4 ms to minimize.
[2024-06-01 12:31:12] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/673 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:31:18] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/673 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/712 variables, and 797 constraints, problems are : Problem set: 0 solved, 99 unsolved in 75012 ms.
Refiners :[Domain max(s): 277/281 constraints, Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 3/5 constraints, State Equation: 234/281 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 96/99 constraints, Known Traps: 59/59 constraints]
After SMT, in 105179ms problems are : Problem set: 0 solved, 99 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 99 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 491/491 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 281 transition count 464
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 254 transition count 464
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 54 place count 254 transition count 455
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 72 place count 245 transition count 455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 244 transition count 454
Applied a total of 74 rules in 48 ms. Remains 244 /281 variables (removed 37) and now considering 454/491 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 244/281 places, 454/491 transitions.
RANDOM walk for 4000000 steps (8 resets) in 41512 ms. (96 steps per ms) remains 99/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1670 ms. (239 steps per ms) remains 99/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1691 ms. (236 steps per ms) remains 99/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1835 ms. (217 steps per ms) remains 99/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1954 ms. (204 steps per ms) remains 99/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1852 ms. (215 steps per ms) remains 99/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1911 ms. (209 steps per ms) remains 99/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2324 ms. (172 steps per ms) remains 99/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2185 ms. (182 steps per ms) remains 99/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2434 ms. (164 steps per ms) remains 92/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2616 ms. (152 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2272 ms. (175 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2147 ms. (186 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2798 ms. (142 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2460 ms. (162 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2380 ms. (167 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2342 ms. (170 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1969 ms. (203 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2241 ms. (178 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2465 ms. (162 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1727 ms. (231 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2448 ms. (163 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2578 ms. (155 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2409 ms. (165 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2292 ms. (174 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2186 ms. (182 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2037 ms. (196 steps per ms) remains 88/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2364 ms. (169 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2063 ms. (193 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2086 ms. (191 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2570 ms. (155 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2187 ms. (182 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2156 ms. (185 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2141 ms. (186 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2445 ms. (163 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2231 ms. (179 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1842 ms. (217 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2324 ms. (172 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2275 ms. (175 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2182 ms. (183 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1799 ms. (222 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2633 ms. (151 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2611 ms. (153 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2015 ms. (198 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2172 ms. (184 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1995 ms. (200 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1970 ms. (202 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2358 ms. (169 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2034 ms. (196 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2322 ms. (172 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2208 ms. (181 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2115 ms. (189 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2315 ms. (172 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2207 ms. (181 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2163 ms. (184 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2253 ms. (177 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2221 ms. (180 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2180 ms. (183 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2233 ms. (179 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2270 ms. (176 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2126 ms. (188 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2184 ms. (183 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2393 ms. (167 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2341 ms. (170 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2328 ms. (171 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2244 ms. (178 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1896 ms. (210 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2177 ms. (183 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2310 ms. (173 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2209 ms. (180 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2102 ms. (190 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2171 ms. (184 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2344 ms. (170 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2294 ms. (174 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2315 ms. (172 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2260 ms. (176 steps per ms) remains 88/88 properties
[2024-06-01 12:32:37] [INFO ] Flow matrix only has 394 transitions (discarded 60 similar events)
// Phase 1: matrix 394 rows 244 cols
[2024-06-01 12:32:37] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 12:32:37] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 74/162 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 3/165 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 3/168 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 270/438 variables, 168/345 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 48/393 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 14 (OVERLAPS) 52/490 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 20/433 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 18 (OVERLAPS) 80/570 variables, 16/453 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/570 variables, 16/469 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/570 variables, 68/537 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/570 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 22 (OVERLAPS) 36/606 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 36/575 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 25 (OVERLAPS) 2/608 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/608 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/608 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 28 (OVERLAPS) 2/610 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/610 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/610 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 31 (OVERLAPS) 28/638 variables, 40/623 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/638 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 33 (OVERLAPS) 0/638 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 638/638 variables, and 623 constraints, problems are : Problem set: 0 solved, 88 unsolved in 18314 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 244/244 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 74/162 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 3/165 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 3/168 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:32:57] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:32:57] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:32:57] [INFO ] Deduced a trap composed of 94 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 270/438 variables, 168/348 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 48/396 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 85/481 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 16 (OVERLAPS) 52/490 variables, 20/501 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 20/521 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 4/525 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 3 ms to minimize.
[2024-06-01 12:33:03] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2024-06-01 12:33:04] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 9/534 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:33:06] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 22 (OVERLAPS) 80/570 variables, 16/551 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/570 variables, 16/567 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/570 variables, 68/635 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:33:13] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:33:13] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:33:14] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:33:14] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:33:14] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:33:14] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 3 ms to minimize.
[2024-06-01 12:33:14] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 3 ms to minimize.
[2024-06-01 12:33:14] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 3 ms to minimize.
[2024-06-01 12:33:15] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:33:15] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-06-01 12:33:15] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/570 variables, 13/648 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:33:19] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:33:19] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:33:20] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/570 variables, 3/651 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:33:23] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/570 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/570 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 29 (OVERLAPS) 36/606 variables, 2/654 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/606 variables, 36/690 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:33:31] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
[2024-06-01 12:33:31] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 4 ms to minimize.
[2024-06-01 12:33:31] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
[2024-06-01 12:33:31] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:33:31] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 2 ms to minimize.
[2024-06-01 12:33:31] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 3 ms to minimize.
[2024-06-01 12:33:32] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:33:32] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:33:32] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:33:32] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:33:32] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-06-01 12:33:32] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 3 ms to minimize.
[2024-06-01 12:33:33] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:33:33] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 3 ms to minimize.
[2024-06-01 12:33:33] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 2 ms to minimize.
[2024-06-01 12:33:33] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 3 ms to minimize.
[2024-06-01 12:33:33] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:33:34] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:33:34] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:33:34] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/606 variables, 20/710 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:33:38] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:33:38] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:33:39] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/606 variables, 3/713 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:33:44] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:33:44] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:33:44] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:33:45] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 3 ms to minimize.
[2024-06-01 12:33:45] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/606 variables, 5/718 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/606 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 35 (OVERLAPS) 2/608 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/608 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/608 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 38 (OVERLAPS) 2/610 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/610 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/610 variables, 3/729 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:34:20] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 3 ms to minimize.
[2024-06-01 12:34:20] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
[2024-06-01 12:34:20] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 3 ms to minimize.
[2024-06-01 12:34:21] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 3 ms to minimize.
[2024-06-01 12:34:22] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-06-01 12:34:22] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 4 ms to minimize.
[2024-06-01 12:34:22] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 3 ms to minimize.
[2024-06-01 12:34:23] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-06-01 12:34:23] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 3 ms to minimize.
[2024-06-01 12:34:23] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:34:23] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/610 variables, 11/740 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/638 variables, and 740 constraints, problems are : Problem set: 0 solved, 88 unsolved in 90009 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 204/244 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 69/69 constraints]
After SMT, in 108346ms problems are : Problem set: 0 solved, 88 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 454/454 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 244 transition count 447
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 237 transition count 447
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 237 transition count 445
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 235 transition count 445
Applied a total of 18 rules in 26 ms. Remains 235 /244 variables (removed 9) and now considering 445/454 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 235/244 places, 445/454 transitions.
RANDOM walk for 3929815 steps (8 resets) in 95027 ms. (41 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2480 ms. (161 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2216 ms. (180 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2625 ms. (152 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2193 ms. (182 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2657 ms. (150 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1860 ms. (214 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2267 ms. (176 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2085 ms. (191 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2179 ms. (183 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1923 ms. (207 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1960 ms. (203 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2339 ms. (170 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1883 ms. (212 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2241 ms. (178 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2090 ms. (191 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2294 ms. (174 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2388 ms. (167 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1744 ms. (229 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1932 ms. (206 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2045 ms. (195 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2250 ms. (177 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2377 ms. (168 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2095 ms. (190 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2426 ms. (164 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2025 ms. (197 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2350 ms. (170 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2076 ms. (192 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2131 ms. (187 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1863 ms. (214 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2492 ms. (160 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2188 ms. (182 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2465 ms. (162 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2221 ms. (180 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1869 ms. (213 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2327 ms. (171 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2282 ms. (175 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2375 ms. (168 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1830 ms. (218 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2467 ms. (162 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1782 ms. (224 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2166 ms. (184 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2123 ms. (188 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1796 ms. (222 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2177 ms. (183 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2005 ms. (199 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2328 ms. (171 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2262 ms. (176 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2615 ms. (152 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2065 ms. (193 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1766 ms. (226 steps per ms) remains 88/88 properties
Interrupted probabilistic random walk after 18200010 steps, run timeout after 204001 ms. (steps per millisecond=89 ) properties seen :75 out of 88
Probabilistic random walk after 18200010 steps, saw 3033731 distinct states, run finished after 204002 ms. (steps per millisecond=89 ) properties seen :75
[2024-06-01 12:38:58] [INFO ] Flow matrix only has 385 transitions (discarded 60 similar events)
// Phase 1: matrix 385 rows 235 cols
[2024-06-01 12:38:58] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 12:38:58] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 32/45 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/46 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/47 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 81/128 variables, 47/97 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 84/212 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/212 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/212 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 160/372 variables, 32/181 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/372 variables, 32/213 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/372 variables, 108/321 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/372 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 128/500 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/500 variables, 128/453 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/500 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (OVERLAPS) 4/504 variables, 4/457 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/504 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/504 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (OVERLAPS) 4/508 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/508 variables, 4/469 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/508 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (OVERLAPS) 112/620 variables, 136/605 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/620 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (OVERLAPS) 0/620 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 620/620 variables, and 605 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1605 ms.
Refiners :[Domain max(s): 235/235 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 235/235 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 32/45 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/46 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/47 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 81/128 variables, 47/97 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 7/112 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 84/212 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/212 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/212 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/212 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 160/372 variables, 32/188 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/372 variables, 32/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/372 variables, 108/328 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 128/500 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/500 variables, 128/460 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/500 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 4/504 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/504 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/504 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (OVERLAPS) 4/508 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/508 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/508 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:39:01] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-06-01 12:39:01] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 3 ms to minimize.
[2024-06-01 12:39:01] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:39:01] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:39:01] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:39:01] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/508 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/508 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (OVERLAPS) 112/620 variables, 136/624 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:39:02] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 4 ms to minimize.
[2024-06-01 12:39:02] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 4 ms to minimize.
[2024-06-01 12:39:03] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2024-06-01 12:39:03] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 3 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/620 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/620 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (OVERLAPS) 0/620 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 620/620 variables, and 628 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4338 ms.
Refiners :[Domain max(s): 235/235 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 235/235 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 10/10 constraints]
After SMT, in 5958ms problems are : Problem set: 0 solved, 13 unsolved
Finished Parikh walk after 7784 steps, including 880 resets, run visited all 13 properties in 606 ms. (steps per millisecond=12 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 635 ms.
Able to resolve query StableMarking after proving 480 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 815315 ms.
ITS solved all properties within timeout

BK_STOP 1717245545097

--------------------
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="Peterson-PT-4"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-4, 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 r514-smll-171654416900168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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