About the Execution of GreatSPN+red for ShieldIIPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7119.031 | 1800000.00 | 3055652.00 | 3989.10 | [undef] | Time out reached |
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.r364-tall-171683777300198.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldIIPt-PT-040B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683777300198
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 686K 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 1716910864044
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 15:41:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-28 15:41:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:41:05] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2024-05-28 15:41:05] [INFO ] Transformed 2803 places.
[2024-05-28 15:41:05] [INFO ] Transformed 2603 transitions.
[2024-05-28 15:41:05] [INFO ] Found NUPN structural information;
[2024-05-28 15:41:05] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 661 ms.
Structural test allowed to assert that 1122 places are NOT stable. Took 21 ms.
RANDOM walk for 40000 steps (8 resets) in 10681 ms. (3 steps per ms) remains 1181/1681 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 19 ms. (6 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 20 ms. (5 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1181/1181 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1181/1181 properties
// Phase 1: matrix 2603 rows 2803 cols
[2024-05-28 15:41:09] [INFO ] Computed 361 invariants in 58 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1181 variables, 1181/1181 constraints. Problems are: Problem set: 0 solved, 1181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1181/5406 variables, and 1181 constraints, problems are : Problem set: 0 solved, 1181 unsolved in 5281 ms.
Refiners :[Domain max(s): 1181/2803 constraints, Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2803 constraints, PredecessorRefiner: 1181/1181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1181 variables, 1181/1181 constraints. Problems are: Problem set: 0 solved, 1181 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1181/5406 variables, and 1181 constraints, problems are : Problem set: 0 solved, 1181 unsolved in 5033 ms.
Refiners :[Domain max(s): 1181/2803 constraints, Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2803 constraints, PredecessorRefiner: 0/1181 constraints, Known Traps: 0/0 constraints]
After SMT, in 11247ms problems are : Problem set: 0 solved, 1181 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1181 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 429 rules applied. Total rules applied 429 place count 2803 transition count 2174
Reduce places removed 429 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 431 rules applied. Total rules applied 860 place count 2374 transition count 2172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 861 place count 2373 transition count 2172
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 861 place count 2373 transition count 2121
Deduced a syphon composed of 51 places in 8 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 963 place count 2322 transition count 2121
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 1042 place count 2243 transition count 2042
Iterating global reduction 3 with 79 rules applied. Total rules applied 1121 place count 2243 transition count 2042
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 1121 place count 2243 transition count 2010
Deduced a syphon composed of 32 places in 23 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1185 place count 2211 transition count 2010
Performed 542 Post agglomeration using F-continuation condition.Transition count delta: 542
Deduced a syphon composed of 542 places in 4 ms
Reduce places removed 542 places and 0 transitions.
Iterating global reduction 3 with 1084 rules applied. Total rules applied 2269 place count 1669 transition count 1468
Renaming transitions due to excessive name length > 1024 char.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2335 place count 1636 transition count 1487
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2336 place count 1636 transition count 1486
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2338 place count 1636 transition count 1484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2340 place count 1634 transition count 1484
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 2352 place count 1634 transition count 1484
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2353 place count 1633 transition count 1483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2355 place count 1631 transition count 1483
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2355 place count 1631 transition count 1482
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2357 place count 1630 transition count 1482
Applied a total of 2357 rules in 740 ms. Remains 1630 /2803 variables (removed 1173) and now considering 1482/2603 (removed 1121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 1630/2803 places, 1482/2603 transitions.
RANDOM walk for 1750900 steps (4 resets) in 120005 ms. (14 steps per ms) remains 596/1181 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
// Phase 1: matrix 1482 rows 1630 cols
[2024-05-28 15:41:52] [INFO ] Computed 359 invariants in 7 ms
[2024-05-28 15:41:52] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 203/799 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/799 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 741/1540 variables, 799/938 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/3112 variables, and 938 constraints, problems are : Problem set: 0 solved, 596 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 139/359 constraints, State Equation: 799/1630 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 203/799 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-28 15:42:44] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 19 ms to minimize.
[2024-05-28 15:42:46] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:42:47] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2024-05-28 15:42:48] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 3 ms to minimize.
[2024-05-28 15:42:49] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:42:51] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 2 ms to minimize.
[2024-05-28 15:42:52] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 4 ms to minimize.
[2024-05-28 15:42:52] [INFO ] Deduced a trap composed of 56 places in 230 ms of which 3 ms to minimize.
[2024-05-28 15:42:52] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 3 ms to minimize.
[2024-05-28 15:42:52] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-28 15:42:53] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 3 ms to minimize.
[2024-05-28 15:42:55] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 4 ms to minimize.
[2024-05-28 15:42:56] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:42:56] [INFO ] Deduced a trap composed of 56 places in 179 ms of which 4 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 4 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 4 ms to minimize.
[2024-05-28 15:43:00] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/799 variables, 17/156 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-28 15:43:03] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:43:05] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 3 ms to minimize.
[2024-05-28 15:43:07] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-05-28 15:43:08] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-28 15:43:08] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 3 ms to minimize.
[2024-05-28 15:43:09] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/799 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-28 15:43:22] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:43:22] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:43:22] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:43:22] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 4 ms to minimize.
SMT process timed out in 90218ms, After SMT, problems are : Problem set: 0 solved, 596 unsolved
Fused 596 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 596 out of 1630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1630/1630 places, 1482/1482 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 1630 transition count 1359
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 246 place count 1507 transition count 1359
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 246 place count 1507 transition count 1302
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 360 place count 1450 transition count 1302
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 394 place count 1416 transition count 1268
Iterating global reduction 2 with 34 rules applied. Total rules applied 428 place count 1416 transition count 1268
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 428 place count 1416 transition count 1234
Deduced a syphon composed of 34 places in 4 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 496 place count 1382 transition count 1234
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 2 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 768 place count 1246 transition count 1098
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 848 place count 1206 transition count 1123
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 854 place count 1206 transition count 1117
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 860 place count 1200 transition count 1117
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 861 place count 1200 transition count 1117
Applied a total of 861 rules in 487 ms. Remains 1200 /1630 variables (removed 430) and now considering 1117/1482 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 1200/1630 places, 1117/1482 transitions.
RANDOM walk for 2148105 steps (5 resets) in 120004 ms. (17 steps per ms) remains 443/596 properties
BEST_FIRST walk for 40002 steps (8 resets) in 369 ms. (108 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 311 ms. (128 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 489 ms. (81 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 527 ms. (75 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 466 ms. (85 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 565 ms. (70 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 503 ms. (79 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 526 ms. (75 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 551 ms. (72 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 516 ms. (77 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 666 ms. (59 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 532 ms. (75 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 522 ms. (76 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 531 ms. (75 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 485 ms. (82 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 470 ms. (84 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 562 ms. (71 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 536 ms. (74 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 590 ms. (67 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 458 ms. (87 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 625 ms. (63 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 454 ms. (87 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 510 ms. (78 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 479 ms. (83 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 460 ms. (86 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 458 ms. (87 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40000 steps (8 resets) in 429 ms. (93 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 443/443 properties
// Phase 1: matrix 1117 rows 1200 cols
[2024-05-28 15:44:01] [INFO ] Computed 359 invariants in 5 ms
[2024-05-28 15:44:01] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 145/588 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 547/1135 variables, 588/691 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1135 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 84/1219 variables, 45/736 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1219 variables, 5/741 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1219 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 8 (OVERLAPS) 33/1252 variables, 15/756 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1252 variables, 13/769 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2317 variables, and 769 constraints, problems are : Problem set: 0 solved, 443 unsolved in 75019 ms.
Refiners :[Positive P Invariants (semi-flows): 123/359 constraints, State Equation: 646/1200 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 145/588 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-28 15:45:19] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:45:20] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-05-28 15:45:21] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:45:22] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:45:22] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:45:23] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:45:24] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 6 ms to minimize.
[2024-05-28 15:45:25] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 2 ms to minimize.
[2024-05-28 15:45:25] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:45:26] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-28 15:45:28] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:45:33] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:45:33] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 547/1135 variables, 588/704 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1135 variables, 443/1147 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1135/2317 variables, and 1147 constraints, problems are : Problem set: 0 solved, 443 unsolved in 75014 ms.
Refiners :[Positive P Invariants (semi-flows): 103/359 constraints, State Equation: 588/1200 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 13/13 constraints]
After SMT, in 150140ms problems are : Problem set: 0 solved, 443 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 443 out of 1200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1200/1200 places, 1117/1117 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1200 transition count 1086
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1169 transition count 1086
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 62 place count 1169 transition count 1072
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 90 place count 1155 transition count 1072
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 1149 transition count 1066
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 1149 transition count 1066
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 102 place count 1149 transition count 1060
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 1143 transition count 1060
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 198 place count 1101 transition count 1018
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 214 place count 1093 transition count 1022
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 1093 transition count 1016
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 226 place count 1087 transition count 1016
Applied a total of 226 rules in 205 ms. Remains 1087 /1200 variables (removed 113) and now considering 1016/1117 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 1087/1200 places, 1016/1117 transitions.
RANDOM walk for 3333905 steps (8 resets) in 120004 ms. (27 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 305 ms. (130 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 308 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 306 ms. (130 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 292 ms. (136 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 301 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 298 ms. (133 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40002 steps (8 resets) in 303 ms. (131 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 443/443 properties
Interrupted probabilistic random walk after 1924178 steps, run timeout after 99001 ms. (steps per millisecond=19 ) properties seen :0 out of 443
Probabilistic random walk after 1924178 steps, saw 1464061 distinct states, run finished after 99010 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 1016 rows 1087 cols
[2024-05-28 15:48:44] [INFO ] Computed 359 invariants in 3 ms
[2024-05-28 15:48:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 103/546 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 509/1055 variables, 546/649 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 63/1118 variables, 41/690 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1118 variables, 18/708 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1118 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 8 (OVERLAPS) 2/1120 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1120 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1120 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 11 (OVERLAPS) 24/1144 variables, 12/724 constraints. Problems are: Problem set: 0 solved, 443 unsolved
SMT process timed out in 90098ms, After SMT, problems are : Problem set: 0 solved, 443 unsolved
Fused 443 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 443 out of 1087 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1087/1087 places, 1016/1016 transitions.
Applied a total of 0 rules in 23 ms. Remains 1087 /1087 variables (removed 0) and now considering 1016/1016 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1087/1087 places, 1016/1016 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1087/1087 places, 1016/1016 transitions.
Applied a total of 0 rules in 45 ms. Remains 1087 /1087 variables (removed 0) and now considering 1016/1016 (removed 0) transitions.
[2024-05-28 15:50:14] [INFO ] Invariant cache hit.
[2024-05-28 15:50:15] [INFO ] Implicit Places using invariants in 577 ms returned [1076]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 599 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1086/1087 places, 1016/1016 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1085 transition count 1015
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1085 transition count 1015
Applied a total of 2 rules in 45 ms. Remains 1085 /1086 variables (removed 1) and now considering 1015/1016 (removed 1) transitions.
// Phase 1: matrix 1015 rows 1085 cols
[2024-05-28 15:50:15] [INFO ] Computed 358 invariants in 2 ms
[2024-05-28 15:50:15] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-05-28 15:50:15] [INFO ] Invariant cache hit.
[2024-05-28 15:50:16] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1085/1087 places, 1015/1016 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2192 ms. Remains : 1085/1087 places, 1015/1016 transitions.
RANDOM walk for 2900950 steps (8 resets) in 120006 ms. (24 steps per ms) remains 441/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 460 ms. (86 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 408 ms. (97 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 551 ms. (72 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 532 ms. (75 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 511 ms. (78 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 639 ms. (62 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 497 ms. (80 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 667 ms. (59 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40002 steps (8 resets) in 613 ms. (65 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 523 ms. (76 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 618 ms. (64 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 498 ms. (80 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 451 ms. (88 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 579 ms. (68 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 545 ms. (73 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 540 ms. (73 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 594 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 461 ms. (86 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 721 ms. (55 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 517 ms. (77 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 715 ms. (55 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 554 ms. (72 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 695 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 496 ms. (80 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 701 ms. (56 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 508 ms. (78 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 681 ms. (58 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 503 ms. (79 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 488 ms. (81 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 560 ms. (71 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 594 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 514 ms. (77 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 611 ms. (65 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 610 ms. (65 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40002 steps (8 resets) in 484 ms. (82 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 585 ms. (68 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 600 ms. (66 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 594 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40002 steps (8 resets) in 606 ms. (65 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 549 ms. (72 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 640 ms. (62 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 487 ms. (81 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 595 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 581 ms. (68 steps per ms) remains 441/441 properties
Interrupted probabilistic random walk after 2020413 steps, run timeout after 114001 ms. (steps per millisecond=17 ) properties seen :0 out of 441
Probabilistic random walk after 2020413 steps, saw 1593763 distinct states, run finished after 114002 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-28 15:52:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 99/540 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (OVERLAPS) 496/1036 variables, 540/641 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1036 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (OVERLAPS) 43/1079 variables, 26/667 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 10/677 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1079 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 8 (OVERLAPS) 3/1082 variables, 3/680 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 3/683 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 11 (OVERLAPS) 11/1093 variables, 6/689 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1093 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1093 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 441 unsolved
SMT process timed out in 105089ms, After SMT, problems are : Problem set: 0 solved, 441 unsolved
Fused 441 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 441 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 1015/1015 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1085 transition count 1013
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1083 transition count 1013
Applied a total of 4 rules in 25 ms. Remains 1083 /1085 variables (removed 2) and now considering 1013/1015 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1083/1085 places, 1013/1015 transitions.
RANDOM walk for 1511662 steps (4 resets) in 120004 ms. (12 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 624 ms. (64 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 537 ms. (74 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 615 ms. (64 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 532 ms. (75 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 591 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 573 ms. (69 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40002 steps (8 resets) in 573 ms. (69 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40002 steps (8 resets) in 590 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 672 ms. (59 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 598 ms. (66 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 461 ms. (86 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 506 ms. (78 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 675 ms. (59 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 626 ms. (63 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 589 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 503 ms. (79 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 603 ms. (66 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 519 ms. (76 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 601 ms. (66 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 503 ms. (79 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 470 ms. (84 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 540 ms. (73 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 673 ms. (59 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 543 ms. (73 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 514 ms. (77 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 590 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 522 ms. (76 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 518 ms. (77 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 540 ms. (73 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 492 ms. (81 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 512 ms. (77 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 589 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 544 ms. (73 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 612 ms. (65 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 524 ms. (76 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40003 steps (8 resets) in 605 ms. (66 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40002 steps (8 resets) in 542 ms. (73 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 657 ms. (60 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 591 ms. (67 steps per ms) remains 441/441 properties
Interrupted probabilistic random walk after 2053185 steps, run timeout after 114001 ms. (steps per millisecond=18 ) properties seen :0 out of 441
Probabilistic random walk after 2053185 steps, saw 1611233 distinct states, run finished after 114002 ms. (steps per millisecond=18 ) properties seen :0
// Phase 1: matrix 1013 rows 1083 cols
[2024-05-28 15:57:06] [INFO ] Computed 358 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 99/540 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (OVERLAPS) 496/1036 variables, 540/641 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1036 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (OVERLAPS) 43/1079 variables, 26/667 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 10/677 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1079 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 8 (OVERLAPS) 3/1082 variables, 3/680 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 3/683 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 11 (OVERLAPS) 10/1092 variables, 6/689 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1092 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1092 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 14 (OVERLAPS) 7/1099 variables, 4/696 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1099 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1099/2096 variables, and 698 constraints, problems are : Problem set: 0 solved, 441 unsolved in 120024 ms.
Refiners :[Positive P Invariants (semi-flows): 119/358 constraints, State Equation: 579/1083 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 99/540 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-28 15:59:10] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:59:11] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2024-05-28 15:59:11] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 3 ms to minimize.
[2024-05-28 15:59:12] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:59:13] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:59:13] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:59:14] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:59:15] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 3 ms to minimize.
[2024-05-28 15:59:15] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:59:16] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-28 15:59:18] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-28 15:59:26] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:59:26] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2024-05-28 15:59:26] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:59:27] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-28 15:59:32] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 8 ms to minimize.
[2024-05-28 15:59:32] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:59:35] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-28 15:59:42] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-28 15:59:46] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 3 ms to minimize.
[2024-05-28 15:59:47] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 3 ms to minimize.
[2024-05-28 15:59:47] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:59:47] [INFO ] Deduced a trap composed of 116 places in 97 ms of which 3 ms to minimize.
[2024-05-28 15:59:47] [INFO ] Deduced a trap composed of 136 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:59:47] [INFO ] Deduced a trap composed of 140 places in 92 ms of which 3 ms to minimize.
[2024-05-28 15:59:49] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 7/127 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-28 15:59:52] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 3 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 116 places in 100 ms of which 3 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 120 places in 94 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 10 (OVERLAPS) 496/1036 variables, 540/675 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1036 variables, 441/1116 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1036 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 441 unsolved
SMT process timed out in 240115ms, After SMT, problems are : Problem set: 0 solved, 441 unsolved
Fused 441 Parikh solutions to 185 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 441 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 1013/1013 transitions.
Applied a total of 0 rules in 42 ms. Remains 1083 /1083 variables (removed 0) and now considering 1013/1013 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1083/1083 places, 1013/1013 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 1013/1013 transitions.
Applied a total of 0 rules in 15 ms. Remains 1083 /1083 variables (removed 0) and now considering 1013/1013 (removed 0) transitions.
[2024-05-28 16:01:06] [INFO ] Invariant cache hit.
[2024-05-28 16:01:07] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-28 16:01:07] [INFO ] Invariant cache hit.
[2024-05-28 16:01:08] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
[2024-05-28 16:01:08] [INFO ] Redundant transitions in 50 ms returned []
Running 1010 sub problems to find dead transitions.
[2024-05-28 16:01:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1083 variables, 358/358 constraints. Problems are: Problem set: 0 solved, 1010 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/2096 variables, and 358 constraints, problems are : Problem set: 0 solved, 1010 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 0/1083 constraints, PredecessorRefiner: 1010/1010 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1010 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1083 variables, 358/358 constraints. Problems are: Problem set: 0 solved, 1010 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1083 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1010 unsolved
At refinement iteration 2 (OVERLAPS) 1013/2096 variables, 1083/1441 constraints. Problems are: Problem set: 0 solved, 1010 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2096 variables, 1010/2451 constraints. Problems are: Problem set: 0 solved, 1010 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2096/2096 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1010 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 1083/1083 constraints, PredecessorRefiner: 1010/1010 constraints, Known Traps: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 1010 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61831 ms. Remains : 1083/1083 places, 1013/1013 transitions.
RANDOM walk for 400000 steps (8 resets) in 14496 ms. (27 steps per ms) remains 441/441 properties
Running SMT prover for 441 properties.
[2024-05-28 16:02:12] [INFO ] Invariant cache hit.
[2024-05-28 16:02:12] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2024-05-28 16:02:13] [INFO ] After 705ms SMT Verify possible using state equation in real domain returned unsat :0 sat :441
TRAPS : Iteration 0
[2024-05-28 16:02:46] [INFO ] After 34014ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:441
[2024-05-28 16:02:46] [INFO ] After 34449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:441
[2024-05-28 16:02:47] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2024-05-28 16:02:47] [INFO ] After 682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :441
TRAPS : Iteration 0
[2024-05-28 16:02:51] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:02:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-28 16:02:52] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:02:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-28 16:02:57] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 6 ms to minimize.
[2024-05-28 16:02:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-05-28 16:03:06] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:03:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-05-28 16:03:08] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:03:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-28 16:03:11] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:03:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-28 16:03:14] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:03:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
TRAPS : Iteration 1
[2024-05-28 16:03:19] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:03:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-28 16:03:30] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-28 16:03:33] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:03:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-05-28 16:03:36] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
TRAPS : Iteration 2
[2024-05-28 16:04:00] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:04:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-28 16:04:14] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-28 16:04:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
TRAPS : Iteration 3
[2024-05-28 16:04:41] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
TRAPS : Iteration 4
[2024-05-28 16:04:48] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-28 16:04:53] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-28 16:04:57] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:04:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-28 16:05:08] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:05:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
TRAPS : Iteration 5
[2024-05-28 16:05:21] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:05:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-28 16:05:25] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
TRAPS : Iteration 6
[2024-05-28 16:06:06] [INFO ] After 199619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :440 real:1
[2024-05-28 16:06:06] [INFO ] After 200022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :440 real:1
RANDOM walk for 3575536 steps (8 resets) in 118493 ms. (30 steps per ms) remains 284/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 580 ms. (68 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 608 ms. (65 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 589 ms. (67 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40002 steps (8 resets) in 583 ms. (68 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 569 ms. (70 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 553 ms. (72 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 595 ms. (67 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40002 steps (8 resets) in 598 ms. (66 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 547 ms. (73 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 624 ms. (64 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 614 ms. (65 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 623 ms. (64 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 575 ms. (69 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 625 ms. (63 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 626 ms. (63 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 601 ms. (66 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 584 ms. (68 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40002 steps (8 resets) in 547 ms. (72 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 598 ms. (66 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 606 ms. (65 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 588 ms. (67 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 568 ms. (70 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 632 ms. (63 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 609 ms. (65 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 579 ms. (68 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 574 ms. (69 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 590 ms. (67 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 598 ms. (66 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 625 ms. (63 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 587 ms. (68 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40002 steps (8 resets) in 568 ms. (70 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 646 ms. (61 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 590 ms. (67 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 606 ms. (65 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 601 ms. (66 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 590 ms. (67 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 568 ms. (70 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 596 ms. (67 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 631 ms. (63 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40004 steps (8 resets) in 581 ms. (68 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 577 ms. (69 steps per ms) remains 284/284 properties
BEST_FIRST walk for 40003 steps (8 resets) in 581 ms. (68 steps per ms) remains 284/284 properties
[2024-05-28 16:06:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 137/421 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 399/820 variables, 421/493 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 78/898 variables, 45/538 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 26/924 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/924 variables, 10/567 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/924 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 2/926 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/926 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 13 (OVERLAPS) 52/978 variables, 34/602 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/978 variables, 3/605 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/978 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 16 (OVERLAPS) 12/990 variables, 4/609 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/990 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/990 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 19 (OVERLAPS) 52/1042 variables, 33/643 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1042 variables, 6/649 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1042 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 22 (OVERLAPS) 8/1050 variables, 4/653 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1050 variables, 3/656 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1050 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 25 (OVERLAPS) 2/1052 variables, 1/657 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1052 variables, 2/659 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1052 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 28 (OVERLAPS) 39/1091 variables, 21/680 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1091 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1091 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 31 (OVERLAPS) 5/1096 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1096 variables, 5/693 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/2096 variables, and 693 constraints, problems are : Problem set: 0 solved, 284 unsolved in 135012 ms.
Refiners :[Positive P Invariants (semi-flows): 118/358 constraints, State Equation: 575/1083 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 137/421 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-28 16:09:02] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:09:02] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:09:02] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:09:03] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:09:03] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:09:03] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:09:03] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:09:04] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-28 16:09:07] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:09:07] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:09:07] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:09:07] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-28 16:09:10] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2024-05-28 16:09:10] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2024-05-28 16:09:10] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 399/820 variables, 421/508 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/820 variables, 284/792 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 78/898 variables, 45/837 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/898 variables, 7/844 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/898 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 12 (OVERLAPS) 26/924 variables, 12/856 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/924 variables, 10/866 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/924 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 15 (OVERLAPS) 2/926 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 284 unsolved
BK_TIME_CONFINEMENT_REACHED
--------------------
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="ShieldIIPt-PT-040B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPt-PT-040B, 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 r364-tall-171683777300198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B 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 '
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 ;