MCC'2024- Execution of r135-tall-171631131300546

About the Execution of GreatSPN+red for DoubleExponent-PT-004

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15627.688	305778.00	920372.00	348.90	??T?T???????????	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131300546.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 DoubleExponent-PT-004, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 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 67K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-00
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-01
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-02
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-03
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-04
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-05
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-06
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-07
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-08
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-09
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-10
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2024-11
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2023-12
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2023-13
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2023-14
FORMULA_NAME DoubleExponent-PT-004-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716376378123

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:12:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 11:12:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:12:59] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-22 11:12:59] [INFO ] Transformed 216 places.
[2024-05-22 11:12:59] [INFO ] Transformed 198 transitions.
[2024-05-22 11:12:59] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 82 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 212 transition count 198
Applied a total of 4 rules in 32 ms. Remains 212 /216 variables (removed 4) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 212 cols
[2024-05-22 11:12:59] [INFO ] Computed 21 invariants in 31 ms
[2024-05-22 11:12:59] [INFO ] Implicit Places using invariants in 303 ms returned [84, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 337 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/216 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 19 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-22 11:13:00] [INFO ] Computed 19 invariants in 5 ms
[2024-05-22 11:13:00] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 11:13:00] [INFO ] Invariant cache hit.
[2024-05-22 11:13:00] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/216 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 861 ms. Remains : 209/216 places, 197/198 transitions.
Support contains 82 out of 209 places after structural reductions.
[2024-05-22 11:13:00] [INFO ] Flatten gal took : 48 ms
[2024-05-22 11:13:00] [INFO ] Flatten gal took : 16 ms
[2024-05-22 11:13:00] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 80 out of 209 places (down from 82) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 57 to 56
RANDOM walk for 40000 steps (1341 resets) in 2173 ms. (18 steps per ms) remains 43/56 properties
BEST_FIRST walk for 4001 steps (114 resets) in 98 ms. (40 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (107 resets) in 130 ms. (30 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (116 resets) in 47 ms. (83 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (110 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (113 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (113 resets) in 42 ms. (93 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (108 resets) in 33 ms. (117 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (113 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (112 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (116 resets) in 22 ms. (173 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (111 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (112 resets) in 43 ms. (90 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (110 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (116 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (113 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (120 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (116 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (110 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (109 resets) in 37 ms. (105 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (115 resets) in 55 ms. (71 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (110 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (109 resets) in 27 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (112 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (107 resets) in 31 ms. (125 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (114 resets) in 35 ms. (111 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (111 resets) in 45 ms. (86 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (113 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (102 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (110 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (113 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (112 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (117 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (105 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (108 resets) in 22 ms. (173 steps per ms) remains 35/43 properties
BEST_FIRST walk for 4000 steps (113 resets) in 76 ms. (51 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (110 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (117 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (109 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (117 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (117 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
[2024-05-22 11:13:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 10/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 6/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 109/175 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 186/362 variables, 176/195 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 43/405 variables, 32/227 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 13 (OVERLAPS) 1/406 variables, 1/228 constraints. Problems are: Problem set: 5 solved, 30 unsolved
[2024-05-22 11:13:03] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 14 ms to minimize.
[2024-05-22 11:13:03] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:13:03] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 3/231 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/231 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 16 (OVERLAPS) 0/406 variables, 0/231 constraints. Problems are: Problem set: 5 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 231 constraints, problems are : Problem set: 5 solved, 30 unsolved in 2931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 5 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 10/51 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 111/168 variables, 15/17 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/17 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 5/173 variables, 2/19 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 186/359 variables, 173/192 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 11/203 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 0/203 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 46/405 variables, 35/238 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 19/257 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/405 variables, 2/259 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 0/259 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 16 (OVERLAPS) 1/406 variables, 1/260 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/406 variables, 1/261 constraints. Problems are: Problem set: 5 solved, 30 unsolved
[2024-05-22 11:13:07] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 2 ms to minimize.
[2024-05-22 11:13:08] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/406 variables, 2/263 constraints. Problems are: Problem set: 5 solved, 30 unsolved
[2024-05-22 11:13:09] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:13:09] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/406 variables, 2/265 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/406 variables, 0/265 constraints. Problems are: Problem set: 5 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 265 constraints, problems are : Problem set: 5 solved, 30 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 30/35 constraints, Known Traps: 7/7 constraints]
After SMT, in 7974ms problems are : Problem set: 5 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 207 transition count 174
Reduce places removed 21 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 26 rules applied. Total rules applied 49 place count 186 transition count 169
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 54 place count 181 transition count 169
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 54 place count 181 transition count 157
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 78 place count 169 transition count 157
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 126 place count 145 transition count 133
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 134 place count 141 transition count 133
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 141 place count 141 transition count 126
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 148 place count 134 transition count 126
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 159 place count 134 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 133 transition count 125
Applied a total of 160 rules in 76 ms. Remains 133 /209 variables (removed 76) and now considering 125/197 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 133/209 places, 125/197 transitions.
RANDOM walk for 40000 steps (3758 resets) in 677 ms. (58 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4000 steps (274 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (271 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (266 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (277 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (257 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (287 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (287 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (272 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (255 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (266 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (260 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (256 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (284 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (267 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (279 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (284 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (270 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (280 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (279 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (268 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (266 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (289 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (268 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (265 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (271 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (274 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (273 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (263 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 297896 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :16 out of 28
Probabilistic random walk after 297896 steps, saw 149108 distinct states, run finished after 3004 ms. (steps per millisecond=99 ) properties seen :16
// Phase 1: matrix 125 rows 133 cols
[2024-05-22 11:13:13] [INFO ] Computed 19 invariants in 5 ms
[2024-05-22 11:13:13] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 59/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 52/127 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:13:13] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 11 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 2 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:13:14] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/129 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 125/255 variables, 130/164 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 7/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 3/258 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:13:15] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/258 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/258 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/258 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 176 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 133/133 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 59/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 52/127 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:13:15] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:13:15] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:13:15] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 7 ms to minimize.
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 2 ms to minimize.
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 6 ms to minimize.
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/129 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/130 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 125/255 variables, 130/178 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 9/194 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:13:16] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:13:17] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:13:17] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 3/258 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/258 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 0/258 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 205 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2142 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 133/133 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 34/34 constraints]
After SMT, in 3943ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 6889 ms.
Support contains 16 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 125/125 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 133 transition count 120
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 128 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 128 transition count 119
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 127 transition count 119
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 30 place count 118 transition count 110
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 115 transition count 110
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 115 transition count 103
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 108 transition count 103
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 108 transition count 103
Applied a total of 56 rules in 30 ms. Remains 108 /133 variables (removed 25) and now considering 103/125 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 108/133 places, 103/125 transitions.
RANDOM walk for 40000 steps (5543 resets) in 221 ms. (180 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3532 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3506 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3490 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3552 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3573 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3541 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3527 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3516 resets) in 72 ms. (547 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3607 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3577 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3560 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3526 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 282031 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :6 out of 12
Probabilistic random walk after 282031 steps, saw 141690 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :6
// Phase 1: matrix 103 rows 108 cols
[2024-05-22 11:13:28] [INFO ] Computed 19 invariants in 4 ms
[2024-05-22 11:13:28] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 38/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 55/102 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 103/206 variables, 103/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 5/211 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/211 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 151 constraints, problems are : Problem set: 0 solved, 6 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 108/108 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 38/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:28] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 55/102 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:29] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 103/206 variables, 103/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 13/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 5/211 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/211 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/211 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/211 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/211 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 159 constraints, problems are : Problem set: 0 solved, 6 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 108/108 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 1201ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2624 ms.
Support contains 9 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 103/103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 99
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 104 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 104 transition count 98
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 103 transition count 98
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 100 transition count 95
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 100 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 99 transition count 94
Applied a total of 18 rules in 14 ms. Remains 99 /108 variables (removed 9) and now considering 94/103 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 99/108 places, 94/103 transitions.
RANDOM walk for 40000 steps (5477 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3549 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3542 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3535 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3510 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3550 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3499 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 325451 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 6
Probabilistic random walk after 325451 steps, saw 163401 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 94 rows 99 cols
[2024-05-22 11:13:35] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 11:13:35] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 33/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 45/87 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:35] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:13:35] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
[2024-05-22 11:13:35] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-22 11:13:35] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:13:35] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:13:35] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/94 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:35] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:13:35] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-22 11:13:35] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 94/188 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 14/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/193 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/193 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 141 constraints, problems are : Problem set: 0 solved, 6 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 99/99 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 33/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:35] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 45/87 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:36] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:13:36] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/94 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 94/188 variables, 94/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 5/193 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/193 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/193 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/193 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/193 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 150 constraints, problems are : Problem set: 0 solved, 6 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 99/99 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 12/12 constraints]
After SMT, in 1015ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2729 ms.
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 99/99 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-22 11:13:39] [INFO ] Invariant cache hit.
[2024-05-22 11:13:39] [INFO ] Implicit Places using invariants in 90 ms returned [22, 67, 72, 90, 96]
[2024-05-22 11:13:39] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 97/99 places, 94/94 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 93
Applied a total of 2 rules in 7 ms. Remains 96 /97 variables (removed 1) and now considering 93/94 (removed 1) transitions.
// Phase 1: matrix 93 rows 96 cols
[2024-05-22 11:13:39] [INFO ] Computed 17 invariants in 2 ms
[2024-05-22 11:13:39] [INFO ] Implicit Places using invariants in 66 ms returned [22, 87, 93]
[2024-05-22 11:13:39] [INFO ] Actually due to overlaps returned [93, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 94/99 places, 93/94 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 92
Applied a total of 2 rules in 6 ms. Remains 93 /94 variables (removed 1) and now considering 92/93 (removed 1) transitions.
// Phase 1: matrix 92 rows 93 cols
[2024-05-22 11:13:39] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 11:13:39] [INFO ] Implicit Places using invariants in 61 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 92/99 places, 92/94 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 92 transition count 92
Applied a total of 1 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 92 cols
[2024-05-22 11:13:39] [INFO ] Computed 14 invariants in 3 ms
[2024-05-22 11:13:39] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 11:13:39] [INFO ] Invariant cache hit.
[2024-05-22 11:13:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:13:39] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 92/99 places, 92/94 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 513 ms. Remains : 92/99 places, 92/94 transitions.
RANDOM walk for 40000 steps (6282 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3786 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3854 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3870 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3796 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3812 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3812 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 372762 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 6
Probabilistic random walk after 372762 steps, saw 186503 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-22 11:13:42] [INFO ] Invariant cache hit.
[2024-05-22 11:13:42] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 16/87 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 92/179 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/184 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/184 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 121 constraints, problems are : Problem set: 0 solved, 6 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:42] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 16/87 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 92/179 variables, 87/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 14/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 5/184 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/184 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 137 constraints, problems are : Problem set: 0 solved, 6 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 11/11 constraints]
After SMT, in 987ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6354 ms.
Support contains 9 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-22 11:13:50] [INFO ] Invariant cache hit.
[2024-05-22 11:13:50] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 11:13:50] [INFO ] Invariant cache hit.
[2024-05-22 11:13:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:13:50] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-05-22 11:13:50] [INFO ] Redundant transitions in 3 ms returned []
Running 91 sub problems to find dead transitions.
[2024-05-22 11:13:50] [INFO ] Invariant cache hit.
[2024-05-22 11:13:50] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-22 11:13:50] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:13:50] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:13:51] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:13:51] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/184 variables, 92/110 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 14/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 124 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2552 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-22 11:13:53] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 92/184 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 14/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 91/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-22 11:13:54] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:13:54] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/184 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 218 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3478 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints]
After SMT, in 6058ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 6061ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6349 ms. Remains : 92/92 places, 92/92 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 91 transition count 91
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 91 transition count 85
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 85 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 83 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 83 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 82 transition count 82
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 81 transition count 81
Applied a total of 22 rules in 14 ms. Remains 81 /92 variables (removed 11) and now considering 81/92 (removed 11) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 81 rows 81 cols
[2024-05-22 11:13:56] [INFO ] Computed 14 invariants in 3 ms
[2024-05-22 11:13:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:13:56] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-22 11:13:56] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2024-05-22 11:13:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 11:13:56] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 11:13:56] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 11:13:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:13:56] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:13:56] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 11:13:56] [INFO ] After 35ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-22 11:13:56] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-22 11:13:56] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-22 11:13:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2024-05-22 11:13:56] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-22 11:13:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
TRAPS : Iteration 1
[2024-05-22 11:13:56] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-22 11:13:56] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 512 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-004-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:13:56] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:13:56] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:13:56] [INFO ] Input system was already deterministic with 197 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 11:13:56] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:13:56] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:13:56] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 159 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 97 place count 159 transition count 139
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 113 place count 151 transition count 139
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 171 place count 122 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 121 transition count 109
Applied a total of 172 rules in 21 ms. Remains 121 /209 variables (removed 88) and now considering 109/197 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 121/209 places, 109/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 109 transitions.
RANDOM walk for 40000 steps (4082 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2700 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 168151 steps, run visited all 1 properties in 389 ms. (steps per millisecond=432 )
Probabilistic random walk after 168151 steps, saw 84107 distinct states, run finished after 392 ms. (steps per millisecond=428 ) properties seen :1
FORMULA DoubleExponent-PT-004-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 207 transition count 152
Reduce places removed 43 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 164 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 162 transition count 150
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 91 place count 162 transition count 140
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 111 place count 152 transition count 140
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 161 place count 127 transition count 115
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 127 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 126 transition count 114
Applied a total of 163 rules in 24 ms. Remains 126 /209 variables (removed 83) and now considering 114/197 (removed 83) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 126/209 places, 114/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 207 transition count 148
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 160 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 95 place count 160 transition count 140
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 111 place count 152 transition count 140
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 165 place count 125 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 124 transition count 112
Applied a total of 166 rules in 17 ms. Remains 124 /209 variables (removed 85) and now considering 112/197 (removed 85) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 124/209 places, 112/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 209/209 places, 197/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 99 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 173 place count 121 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 120 transition count 108
Applied a total of 174 rules in 16 ms. Remains 120 /209 variables (removed 89) and now considering 108/197 (removed 89) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 120/209 places, 108/197 transitions.
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:13:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:13:57] [INFO ] Input system was already deterministic with 108 transitions.
RANDOM walk for 40000 steps (4119 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2700 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1336731 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :0 out of 1
Probabilistic random walk after 1336731 steps, saw 668389 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
// Phase 1: matrix 108 rows 120 cols
[2024-05-22 11:14:00] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 11:14:00] [INFO ] State equation strengthened by 6 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/52 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/96 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/96 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 39/135 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/137 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 83/220 variables, 90/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/220 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/220 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/228 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/228 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/228 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/228 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 120/120 constraints, ReadFeed: 6/6 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/52 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/96 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/96 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/135 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:01] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/137 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 83/220 variables, 90/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/220 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/220 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/228 variables, 7/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/228 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/228 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/228 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 120/120 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 276ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 108/108 transitions.
Graph (complete) has 289 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 119 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 118 transition count 106
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 22 place count 109 transition count 97
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 34 place count 103 transition count 97
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 103 transition count 84
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 60 place count 90 transition count 84
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 75 place count 90 transition count 84
Applied a total of 75 rules in 16 ms. Remains 90 /120 variables (removed 30) and now considering 84/108 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 90/120 places, 84/108 transitions.
RANDOM walk for 4000000 steps (508476 resets) in 5750 ms. (695 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (337135 resets) in 2665 ms. (1500 steps per ms) remains 1/1 properties
Probably explored full state space saw : 480715 states, properties seen :0
Probabilistic random walk after 961443 steps, saw 480715 distinct states, run finished after 2346 ms. (steps per millisecond=409 ) properties seen :0
Interrupted probabilistic random walk after 2478746 steps, run timeout after 6001 ms. (steps per millisecond=413 ) properties seen :0 out of 1
Exhaustive walk after 2478746 steps, saw 1239558 distinct states, run finished after 6006 ms. (steps per millisecond=412 ) properties seen :0
// Phase 1: matrix 84 rows 90 cols
[2024-05-22 11:14:11] [INFO ] Computed 19 invariants in 5 ms
[2024-05-22 11:14:11] [INFO ] State equation strengthened by 13 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) 54/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/85 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-22 11:14:12] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-22 11:14:12] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 84/169 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 13/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/174 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/174 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 90/90 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 54/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/85 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:12] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 84/169 variables, 85/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/174 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/174 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 90/90 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 11:14:12] [INFO ] Invariant cache hit.
[2024-05-22 11:14:12] [INFO ] Implicit Places using invariants in 80 ms returned [21, 27, 58, 63, 81, 87]
[2024-05-22 11:14:12] [INFO ] Actually due to overlaps returned [63, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 88/90 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 83
Applied a total of 2 rules in 4 ms. Remains 87 /88 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 87 cols
[2024-05-22 11:14:12] [INFO ] Computed 17 invariants in 1 ms
[2024-05-22 11:14:12] [INFO ] Implicit Places using invariants in 82 ms returned [21, 27, 78, 84]
[2024-05-22 11:14:12] [INFO ] Actually due to overlaps returned [84, 78]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/90 places, 83/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 82
Applied a total of 2 rules in 3 ms. Remains 84 /85 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 84 cols
[2024-05-22 11:14:12] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 11:14:12] [INFO ] Implicit Places using invariants in 79 ms returned [21, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 82/90 places, 82/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 3 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-05-22 11:14:12] [INFO ] Computed 13 invariants in 2 ms
[2024-05-22 11:14:12] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 11:14:12] [INFO ] Invariant cache hit.
[2024-05-22 11:14:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:14:12] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 81/90 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 495 ms. Remains : 81/90 places, 81/84 transitions.
RANDOM walk for 4000000 steps (572291 resets) in 3764 ms. (1062 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (363711 resets) in 2185 ms. (1829 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1371581 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :0 out of 1
Probabilistic random walk after 1371581 steps, saw 685799 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
[2024-05-22 11:14:17] [INFO ] Invariant cache hit.
[2024-05-22 11:14:17] [INFO ] State equation strengthened by 13 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:17] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:17] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-22 11:14:17] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:14:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:14:17] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-22 11:14:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-22 11:14:17] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:17] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/157 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 455ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:14:17] [INFO ] Invariant cache hit.
[2024-05-22 11:14:17] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 11:14:17] [INFO ] Invariant cache hit.
[2024-05-22 11:14:18] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:14:18] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-22 11:14:18] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 11:14:18] [INFO ] Invariant cache hit.
[2024-05-22 11:14:18] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:18] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:14:18] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:14:18] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:14:18] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:19] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 81/162 variables, 81/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:19] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 113 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 80/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:21] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:14:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:22] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3720 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 6004ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6006ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6249 ms. Remains : 81/81 places, 81/81 transitions.
RANDOM walk for 400000 steps (57381 resets) in 1664 ms. (240 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-22 11:14:24] [INFO ] Invariant cache hit.
[2024-05-22 11:14:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:14:24] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:14:24] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 11:14:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:14:24] [INFO ] After 8ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:14:24] [INFO ] After 16ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:14:24] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:14:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:14:24] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:14:24] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:14:24] [INFO ] After 10ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:14:24] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:14:24] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (571198 resets) in 3076 ms. (1299 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (363289 resets) in 2683 ms. (1490 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1384509 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1384509 steps, saw 692270 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
[2024-05-22 11:14:29] [INFO ] Invariant cache hit.
[2024-05-22 11:14:29] [INFO ] State equation strengthened by 13 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:29] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:29] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 11:14:29] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-22 11:14:29] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-22 11:14:29] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-22 11:14:29] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-22 11:14:29] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:29] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/157 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:14:29] [INFO ] Invariant cache hit.
[2024-05-22 11:14:29] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 11:14:29] [INFO ] Invariant cache hit.
[2024-05-22 11:14:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:14:30] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-22 11:14:30] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 11:14:30] [INFO ] Invariant cache hit.
[2024-05-22 11:14:30] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:30] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:14:30] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2024-05-22 11:14:30] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:14:30] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:30] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 81/162 variables, 81/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:31] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 113 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2331 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 80/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:33] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:14:33] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:34] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3742 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 6099ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6343 ms. Remains : 81/81 places, 81/81 transitions.
RANDOM walk for 400000 steps (57237 resets) in 409 ms. (975 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-22 11:14:36] [INFO ] Invariant cache hit.
[2024-05-22 11:14:36] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-22 11:14:36] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:14:36] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 11:14:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:14:36] [INFO ] After 8ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:14:36] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:14:36] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:14:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:14:36] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:14:36] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:14:36] [INFO ] After 11ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:14:36] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:14:36] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (5711 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3552 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1228807 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1228807 steps, saw 614399 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
[2024-05-22 11:14:39] [INFO ] Invariant cache hit.
[2024-05-22 11:14:39] [INFO ] State equation strengthened by 13 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 11:14:39] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-22 11:14:39] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-22 11:14:39] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-22 11:14:39] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-22 11:14:39] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:39] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/157 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 418ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
RANDOM walk for 40000 steps (5679 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3637 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1231637 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 1
Probabilistic random walk after 1231637 steps, saw 615821 distinct states, run finished after 3001 ms. (steps per millisecond=410 ) properties seen :0
[2024-05-22 11:14:42] [INFO ] Invariant cache hit.
[2024-05-22 11:14:42] [INFO ] State equation strengthened by 13 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:14:43] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:14:43] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-22 11:14:43] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-22 11:14:43] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:14:43] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/162 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:14:43] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/157 variables, 76/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 403ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:14:43] [INFO ] Invariant cache hit.
[2024-05-22 11:14:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 11:14:43] [INFO ] Invariant cache hit.
[2024-05-22 11:14:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:14:43] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-22 11:14:43] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 11:14:43] [INFO ] Invariant cache hit.
[2024-05-22 11:14:43] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:44] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:14:44] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:14:44] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:14:44] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:44] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 81/162 variables, 81/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:45] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 113 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/162 variables, 81/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 80/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:46] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:14:46] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:14:47] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3688 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 5963ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5964ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6193 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 9 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2024-05-22 11:14:49] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:14:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:14:49] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:14:49] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 11:14:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:14:49] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:14:49] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-05-22 11:14:49] [INFO ] After 38ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:14:49] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:14:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:14:49] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:14:49] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:14:49] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:14:49] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:14:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-05-22 11:14:49] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:14:49] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 205 ms.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 6 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
[2024-05-22 11:14:49] [INFO ] Invariant cache hit.
[2024-05-22 11:14:49] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-22 11:14:49] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:14:49] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 11:14:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:14:49] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:14:49] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 11:14:49] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 75 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 99 place count 158 transition count 137
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 117 place count 149 transition count 137
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 171 place count 122 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 121 transition count 109
Applied a total of 172 rules in 15 ms. Remains 121 /209 variables (removed 88) and now considering 109/197 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 121/209 places, 109/197 transitions.
[2024-05-22 11:14:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:14:49] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:14:49] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 207 transition count 151
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 163 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 161 transition count 149
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 93 place count 161 transition count 140
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 111 place count 152 transition count 140
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 167 place count 124 transition count 112
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 124 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 123 transition count 111
Applied a total of 170 rules in 13 ms. Remains 123 /209 variables (removed 86) and now considering 111/197 (removed 86) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 123/209 places, 111/197 transitions.
[2024-05-22 11:14:49] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:14:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:14:49] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-22 11:14:49] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:14:49] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:14:49] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-22 11:14:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 209 places, 197 transitions and 546 arcs took 2 ms.
Total runtime 110607 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-004

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 209
TRANSITIONS: 197
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.002s]

SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]

----------------------------------------------------------------------
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: 1241
MODEL NAME: /home/mcc/execution/413/model
209 places, 197 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 4348 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716376683901

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="DoubleExponent-PT-004"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 DoubleExponent-PT-004, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131300546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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