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.r100-tall-171624200900427.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 DES-PT-20a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200900427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716365828090

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:17:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 08:17:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:17:09] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-22 08:17:09] [INFO ] Transformed 195 places.
[2024-05-22 08:17:09] [INFO ] Transformed 152 transitions.
[2024-05-22 08:17:09] [INFO ] Found NUPN structural information;
[2024-05-22 08:17:09] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 162 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 195/195 places, 152/152 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 195 transition count 138
Applied a total of 14 rules in 27 ms. Remains 195 /195 variables (removed 0) and now considering 138/152 (removed 14) transitions.
// Phase 1: matrix 138 rows 195 cols
[2024-05-22 08:17:09] [INFO ] Computed 59 invariants in 26 ms
[2024-05-22 08:17:09] [INFO ] Implicit Places using invariants in 395 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 425 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 194/195 places, 138/152 transitions.
Applied a total of 0 rules in 5 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 473 ms. Remains : 194/195 places, 138/152 transitions.
Discarding 9 transitions out of 138. Remains 129
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (896 resets) in 1922 ms. (20 steps per ms) remains 64/128 properties
BEST_FIRST walk for 4003 steps (16 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (14 resets) in 28 ms. (138 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (16 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (17 resets) in 36 ms. (108 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (18 resets) in 73 ms. (54 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (17 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (20 resets) in 58 ms. (67 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (19 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (18 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (16 resets) in 47 ms. (83 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (20 resets) in 28 ms. (138 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (17 resets) in 21 ms. (181 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (16 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (16 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (16 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (18 resets) in 27 ms. (142 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (16 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (15 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (13 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (18 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (17 resets) in 32 ms. (121 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (18 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (17 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (14 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (19 resets) in 117 ms. (33 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (17 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (17 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (19 resets) in 27 ms. (142 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (18 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (24 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (23 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (25 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (24 resets) in 11 ms. (333 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (24 resets) in 27 ms. (142 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (22 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (22 resets) in 27 ms. (142 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (23 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (27 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (23 resets) in 13 ms. (285 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (22 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 64/64 properties
// Phase 1: matrix 138 rows 194 cols
[2024-05-22 08:17:11] [INFO ] Computed 58 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 10/79 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 64/143 variables, 27/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 64/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 38/181 variables, 23/199 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 38/237 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 6/187 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 6/245 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 14 (OVERLAPS) 137/324 variables, 187/432 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-22 08:17:13] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 10 ms to minimize.
[2024-05-22 08:17:13] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/324 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 17 (OVERLAPS) 8/332 variables, 7/441 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 7/448 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-22 08:17:15] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/332 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 332/332 variables, and 449 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5021 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 10/79 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 64/143 variables, 27/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 64/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 38/181 variables, 23/199 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 38/237 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 6/187 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 15 (OVERLAPS) 137/324 variables, 187/435 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/324 variables, 18/453 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-22 08:17:20] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-22 08:17:20] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:17:20] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:17:20] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:17:20] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:17:20] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 08:17:20] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/332 variables, and 460 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5015 ms.
Refiners :[Domain max(s): 187/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/194 constraints, PredecessorRefiner: 18/64 constraints, Known Traps: 10/10 constraints]
After SMT, in 10181ms problems are : Problem set: 0 solved, 64 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 138/138 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 193 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 193 transition count 135
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 54 ms. Remains 193 /194 variables (removed 1) and now considering 135/138 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 193/194 places, 135/138 transitions.
RANDOM walk for 4000000 steps (53745 resets) in 31327 ms. (127 steps per ms) remains 55/64 properties
BEST_FIRST walk for 400004 steps (926 resets) in 675 ms. (591 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (907 resets) in 661 ms. (604 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (896 resets) in 649 ms. (615 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (905 resets) in 633 ms. (630 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (885 resets) in 641 ms. (623 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (901 resets) in 649 ms. (615 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400001 steps (894 resets) in 780 ms. (512 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400002 steps (880 resets) in 760 ms. (525 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (920 resets) in 785 ms. (508 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (904 resets) in 654 ms. (610 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (915 resets) in 655 ms. (609 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (930 resets) in 655 ms. (609 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (920 resets) in 666 ms. (599 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (923 resets) in 652 ms. (612 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (915 resets) in 651 ms. (613 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (885 resets) in 649 ms. (615 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (693 resets) in 678 ms. (589 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (711 resets) in 674 ms. (592 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (683 resets) in 878 ms. (455 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (702 resets) in 876 ms. (456 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (714 resets) in 966 ms. (413 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (676 resets) in 871 ms. (458 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400002 steps (695 resets) in 872 ms. (458 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (697 resets) in 859 ms. (465 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (714 resets) in 884 ms. (451 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (713 resets) in 831 ms. (480 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400004 steps (688 resets) in 811 ms. (492 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (715 resets) in 672 ms. (594 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (695 resets) in 660 ms. (605 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (690 resets) in 668 ms. (597 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (2907 resets) in 766 ms. (521 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (2903 resets) in 760 ms. (525 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (2907 resets) in 763 ms. (523 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (2910 resets) in 783 ms. (510 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (2916 resets) in 785 ms. (508 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (2906 resets) in 767 ms. (520 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (2908 resets) in 779 ms. (512 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (2908 resets) in 783 ms. (510 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (2912 resets) in 790 ms. (505 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (2916 resets) in 786 ms. (508 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (2910 resets) in 782 ms. (510 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (2905 resets) in 808 ms. (494 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (2903 resets) in 771 ms. (518 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (2906 resets) in 780 ms. (512 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (964 resets) in 660 ms. (605 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (957 resets) in 666 ms. (599 steps per ms) remains 51/53 properties
BEST_FIRST walk for 400004 steps (952 resets) in 660 ms. (605 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (943 resets) in 658 ms. (606 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (945 resets) in 657 ms. (607 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (969 resets) in 654 ms. (610 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (987 resets) in 669 ms. (597 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (938 resets) in 660 ms. (605 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (984 resets) in 669 ms. (597 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (981 resets) in 795 ms. (502 steps per ms) remains 51/51 properties
// Phase 1: matrix 135 rows 193 cols
[2024-05-22 08:17:42] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 08:17:42] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 10/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 72/138 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-22 08:17:42] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 51 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 45/183 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 135/318 variables, 183/244 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-22 08:17:43] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 08:17:43] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (OVERLAPS) 10/328 variables, 10/258 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-22 08:17:44] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-22 08:17:44] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-22 08:17:45] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 16 (OVERLAPS) 0/328 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 261 constraints, problems are : Problem set: 0 solved, 51 unsolved in 4039 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 10/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 72/138 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 45/183 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 135/318 variables, 183/248 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 15/265 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-22 08:17:47] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (OVERLAPS) 10/328 variables, 10/276 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 36/312 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-22 08:17:53] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 08:17:53] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/328 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-22 08:17:59] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/328 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-22 08:18:06] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/328 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/328 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 23 (OVERLAPS) 0/328 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 317 constraints, problems are : Problem set: 0 solved, 51 unsolved in 30270 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 11/11 constraints]
After SMT, in 34352ms problems are : Problem set: 0 solved, 51 unsolved
Fused 51 Parikh solutions to 50 different solutions.
Parikh walk visited 1 properties in 5630 ms.
Support contains 55 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 4000000 steps (54028 resets) in 31221 ms. (128 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (914 resets) in 1147 ms. (348 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (911 resets) in 856 ms. (466 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (927 resets) in 975 ms. (409 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (890 resets) in 848 ms. (471 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (928 resets) in 909 ms. (439 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (899 resets) in 841 ms. (475 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (900 resets) in 857 ms. (466 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (907 resets) in 1169 ms. (341 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (891 resets) in 909 ms. (439 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (902 resets) in 811 ms. (492 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (912 resets) in 824 ms. (484 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (895 resets) in 857 ms. (466 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (915 resets) in 907 ms. (440 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (925 resets) in 815 ms. (490 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (690 resets) in 1126 ms. (354 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (693 resets) in 884 ms. (451 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (695 resets) in 1113 ms. (359 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (688 resets) in 856 ms. (466 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (689 resets) in 830 ms. (481 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (705 resets) in 929 ms. (430 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (670 resets) in 895 ms. (446 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (680 resets) in 844 ms. (473 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (682 resets) in 854 ms. (467 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (677 resets) in 821 ms. (486 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (704 resets) in 886 ms. (450 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (705 resets) in 825 ms. (484 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (703 resets) in 894 ms. (446 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (2904 resets) in 979 ms. (408 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (2907 resets) in 962 ms. (415 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (2909 resets) in 960 ms. (416 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (2927 resets) in 947 ms. (421 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (2899 resets) in 1023 ms. (390 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (2907 resets) in 989 ms. (404 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (2915 resets) in 1031 ms. (387 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400000 steps (2907 resets) in 1035 ms. (386 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (2915 resets) in 1089 ms. (366 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (2901 resets) in 957 ms. (417 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (2904 resets) in 1187 ms. (336 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (2910 resets) in 973 ms. (410 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (2916 resets) in 1005 ms. (397 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (981 resets) in 868 ms. (460 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (989 resets) in 850 ms. (470 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (986 resets) in 857 ms. (466 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (980 resets) in 830 ms. (481 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (966 resets) in 871 ms. (458 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (958 resets) in 797 ms. (501 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (952 resets) in 1188 ms. (336 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400003 steps (958 resets) in 872 ms. (458 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (959 resets) in 802 ms. (498 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (937 resets) in 857 ms. (466 steps per ms) remains 49/49 properties
Interrupted probabilistic random walk after 17602545 steps, run timeout after 75001 ms. (steps per millisecond=234 ) properties seen :0 out of 49
Probabilistic random walk after 17602545 steps, saw 2150264 distinct states, run finished after 75008 ms. (steps per millisecond=234 ) properties seen :0
[2024-05-22 08:20:03] [INFO ] Invariant cache hit.
[2024-05-22 08:20:03] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 10/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 72/136 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 47/183 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 49 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 135/318 variables, 183/243 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 10/328 variables, 10/255 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-22 08:20:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:20:04] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-22 08:20:04] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-22 08:20:04] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-22 08:20:05] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 260 constraints, problems are : Problem set: 0 solved, 49 unsolved in 3315 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 10/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 72/136 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 47/183 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 135/318 variables, 183/247 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 14/263 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 10/328 variables, 10/273 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 35/308 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-22 08:20:11] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:20:11] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 08:20:11] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:20:11] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:20:11] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-22 08:20:14] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/328 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 18 (OVERLAPS) 0/328 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 315 constraints, problems are : Problem set: 0 solved, 49 unsolved in 19000 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 11/11 constraints]
After SMT, in 22347ms problems are : Problem set: 0 solved, 49 unsolved
Parikh walk visited 35 properties in 30516 ms.
Support contains 18 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 24 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 4000000 steps (53793 resets) in 18151 ms. (220 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (9043 resets) in 5204 ms. (768 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (9053 resets) in 5277 ms. (757 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (9026 resets) in 5320 ms. (751 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (8987 resets) in 5237 ms. (763 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (6897 resets) in 5446 ms. (734 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (7009 resets) in 5445 ms. (734 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (6880 resets) in 5494 ms. (727 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (29126 resets) in 6057 ms. (660 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (29124 resets) in 6094 ms. (656 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (29126 resets) in 6168 ms. (648 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (29120 resets) in 6025 ms. (663 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (29145 resets) in 6234 ms. (641 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (29117 resets) in 6192 ms. (645 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (29136 resets) in 6242 ms. (640 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 25376163 steps, run timeout after 102001 ms. (steps per millisecond=248 ) properties seen :0 out of 14
Probabilistic random walk after 25376163 steps, saw 3070098 distinct states, run finished after 102001 ms. (steps per millisecond=248 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-22 08:23:12] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 08:23:12] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 9/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 74/101 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 72/173 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 14 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 9/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 74/101 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 08:23:13] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 72/173 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 135/308 variables, 173/234 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 08:23:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-22 08:23:13] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-22 08:23:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 08:23:13] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 08:23:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 20/328 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 10/276 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 08:23:14] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:23:14] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2024-05-22 08:23:15] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-22 08:23:15] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/328 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 08:23:15] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-22 08:23:15] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/328 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 08:23:17] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/328 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 0/328 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 283 constraints, problems are : Problem set: 0 solved, 14 unsolved in 6909 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 13/13 constraints]
After SMT, in 7680ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 12 properties in 9134 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 18 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 4000000 steps (53952 resets) in 9201 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (29125 resets) in 3815 ms. (1048 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (29146 resets) in 3833 ms. (1043 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 5225980 steps, run timeout after 12001 ms. (steps per millisecond=435 ) properties seen :0 out of 2
Probabilistic random walk after 5225980 steps, saw 685518 distinct states, run finished after 12002 ms. (steps per millisecond=435 ) properties seen :0
[2024-05-22 08:23:45] [INFO ] Invariant cache hit.
[2024-05-22 08:23:45] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 83/89 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/173 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 08:23:46] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 257 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 83/89 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/173 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 08:23:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 08:23:46] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 135/308 variables, 173/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/328 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1512 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-22 08:23:47] [INFO ] Invariant cache hit.
[2024-05-22 08:23:48] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 08:23:48] [INFO ] Invariant cache hit.
[2024-05-22 08:23:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 08:23:48] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-22 08:23:48] [INFO ] Redundant transitions in 3 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-22 08:23:48] [INFO ] Invariant cache hit.
[2024-05-22 08:23:48] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:23:50] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-22 08:23:50] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/328 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 258 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5243 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:23:54] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-05-22 08:23:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:23:54] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 135/328 variables, 193/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 134/395 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:23:57] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-22 08:23:57] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-22 08:23:58] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-22 08:23:59] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:24:00] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:24:00] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 6/401 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:24:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:24:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:24:13] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:24:13] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:24:21] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-22 08:24:22] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 407 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 17/17 constraints]
After SMT, in 35304ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 35306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35648 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 400000 steps (5395 resets) in 2308 ms. (173 steps per ms) remains 2/3 properties
Running SMT prover for 2 properties.
[2024-05-22 08:24:24] [INFO ] Invariant cache hit.
[2024-05-22 08:24:24] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 08:24:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 08:24:24] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 08:24:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 08:24:24] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 08:24:24] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2024-05-22 08:24:24] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 08:24:24] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 08:24:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 08:24:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-22 08:24:24] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 08:24:24] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 08:24:24] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 08:24:24] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 4000000 steps (53961 resets) in 10080 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (29121 resets) in 3804 ms. (1051 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (29119 resets) in 3805 ms. (1050 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 7140974 steps, run timeout after 15001 ms. (steps per millisecond=476 ) properties seen :0 out of 2
Probabilistic random walk after 7140974 steps, saw 917714 distinct states, run finished after 15001 ms. (steps per millisecond=476 ) properties seen :0
[2024-05-22 08:24:44] [INFO ] Invariant cache hit.
[2024-05-22 08:24:44] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 83/89 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/173 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 08:24:44] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 257 constraints, problems are : Problem set: 0 solved, 2 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 83/89 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/173 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 08:24:45] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 08:24:45] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 135/308 variables, 173/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/328 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 591ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1326 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-22 08:24:46] [INFO ] Invariant cache hit.
[2024-05-22 08:24:46] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-22 08:24:46] [INFO ] Invariant cache hit.
[2024-05-22 08:24:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 08:24:47] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-22 08:24:47] [INFO ] Redundant transitions in 4 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-22 08:24:47] [INFO ] Invariant cache hit.
[2024-05-22 08:24:47] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:24:49] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 08:24:49] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/328 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 258 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5310 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:24:52] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-22 08:24:53] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:24:53] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 135/328 variables, 193/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 134/395 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:24:56] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-22 08:24:56] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 08:24:57] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-22 08:24:58] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 08:24:58] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:24:59] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 6/401 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:25:05] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 08:25:05] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:25:11] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:25:11] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-22 08:25:20] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-22 08:25:21] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 407 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 17/17 constraints]
After SMT, in 35365ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 35368ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35705 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 400000 steps (5425 resets) in 1131 ms. (353 steps per ms) remains 2/3 properties
Running SMT prover for 2 properties.
[2024-05-22 08:25:22] [INFO ] Invariant cache hit.
[2024-05-22 08:25:22] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 08:25:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 08:25:22] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 08:25:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 08:25:22] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 08:25:22] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2024-05-22 08:25:22] [INFO ] After 84ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 08:25:22] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 08:25:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 08:25:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 08:25:23] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 08:25:23] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 08:25:23] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 08:25:23] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 40000 steps (512 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (94 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1888518 steps, run timeout after 3001 ms. (steps per millisecond=629 ) properties seen :0 out of 1
Probabilistic random walk after 1888518 steps, saw 263118 distinct states, run finished after 3001 ms. (steps per millisecond=629 ) properties seen :0
[2024-05-22 08:25:26] [INFO ] Invariant cache hit.
[2024-05-22 08:25:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 69/148 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/173 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/148 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/173 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/328 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 23 ms. Remains 192 /193 variables (removed 1) and now considering 134/135 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 192/193 places, 134/135 transitions.
RANDOM walk for 40000 steps (545 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (86 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1887672 steps, run timeout after 3001 ms. (steps per millisecond=629 ) properties seen :0 out of 1
Probabilistic random walk after 1887672 steps, saw 263024 distinct states, run finished after 3001 ms. (steps per millisecond=629 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2024-05-22 08:25:29] [INFO ] Computed 60 invariants in 9 ms
[2024-05-22 08:25:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/118 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/152 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:25:29] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 360ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-22 08:25:30] [INFO ] Invariant cache hit.
[2024-05-22 08:25:30] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-22 08:25:30] [INFO ] Invariant cache hit.
[2024-05-22 08:25:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:25:30] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-22 08:25:30] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-22 08:25:30] [INFO ] Invariant cache hit.
[2024-05-22 08:25:30] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 08:25:33] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-22 08:25:33] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-22 08:25:33] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:25:33] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:25:33] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 08:25:33] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 08:25:34] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-05-22 08:25:34] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:25:34] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 08:25:34] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:25:34] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 08:25:36] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8366 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 08:25:56] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/326 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 398 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints]
After SMT, in 38418ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 38420ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38726 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2024-05-22 08:26:08] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 08:26:09] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2024-05-22 08:26:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 08:26:09] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 08:26:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 08:26:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 08:26:09] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 08:26:09] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 08:26:09] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 275 ms.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (533 resets) in 346 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (91 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1842938 steps, run timeout after 3001 ms. (steps per millisecond=614 ) properties seen :0 out of 1
Probabilistic random walk after 1842938 steps, saw 257021 distinct states, run finished after 3003 ms. (steps per millisecond=613 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-22 08:26:12] [INFO ] Computed 60 invariants in 9 ms
[2024-05-22 08:26:12] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 69/148 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/173 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/148 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/173 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/328 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 33345 steps, including 116 resets, run visited all 1 properties in 77 ms. (steps per millisecond=433 )
Parikh walk visited 1 properties in 81 ms.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-22 08:26:12] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 08:26:12] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 08:26:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 08:26:12] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 08:26:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-22 08:26:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 08:26:13] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 08:26:13] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 08:26:13] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 310 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :2 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 2 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 543924 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-20a

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 195
TRANSITIONS: 152
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 742
NUPN UNITS: 60
LOADING TIME: 0.248

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.02
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.537
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 989
MODEL NAME: /home/mcc/execution/model
195 places, 152 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiLiveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716366415092

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-20a"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DES-PT-20a, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-tall-171624200900427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;