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.r167-smll-171636275100128.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 itstools
Input is EisenbergMcGuire-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-smll-171636275100128
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.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:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716487180166

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-23 17:59:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-23 17:59:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 17:59:43] [INFO ] Load time of PNML (sax parser for PT used): 811 ms
[2024-05-23 17:59:44] [INFO ] Transformed 1090 places.
[2024-05-23 17:59:44] [INFO ] Transformed 5200 transitions.
[2024-05-23 17:59:44] [INFO ] Found NUPN structural information;
[2024-05-23 17:59:44] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 1282 ms.
RANDOM walk for 40000 steps (8 resets) in 5543 ms. (7 steps per ms) remains 368/1090 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 368/368 properties
[2024-05-23 17:59:46] [INFO ] Flatten gal took : 1035 ms
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 368/368 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 368/368 properties
[2024-05-23 17:59:46] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2024-05-23 17:59:46] [INFO ] Computed 31 invariants in 72 ms
[2024-05-23 17:59:46] [INFO ] Flatten gal took : 334 ms
[2024-05-23 17:59:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10110922696647311953.gal : 131 ms
[2024-05-23 17:59:46] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2024-05-23 17:59:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12290191247133424882.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10110922696647311953.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12290191247133424882.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12290191247133424882.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 368/368 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/3420 variables, and 368 constraints, problems are : Problem set: 0 solved, 368 unsolved in 5173 ms.
Refiners :[Domain max(s): 368/1090 constraints, Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 368/368 constraints. Problems are: Problem set: 0 solved, 368 unsolved
SDD proceeding with computation,368 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,368 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,368 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,368 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,368 properties remain. new max is 64
SDD size :10 after 12
SDD proceeding with computation,368 properties remain. new max is 128
SDD size :12 after 14
SDD proceeding with computation,368 properties remain. new max is 256
SDD size :14 after 15
SDD proceeding with computation,368 properties remain. new max is 512
SDD size :15 after 77
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 368 unsolved
SDD proceeding with computation,368 properties remain. new max is 1024
SDD size :77 after 155
At refinement iteration 2 (OVERLAPS) 692/1060 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1060 variables, 692/1080 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1060/3420 variables, and 1080 constraints, problems are : Problem set: 0 solved, 368 unsolved in 5048 ms.
Refiners :[Domain max(s): 1060/1090 constraints, Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/1090 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 0/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 11053ms problems are : Problem set: 0 solved, 368 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 368 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
SDD proceeding with computation,368 properties remain. new max is 2048
SDD size :155 after 280
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 220 Pre rules applied. Total rules applied 20 place count 1080 transition count 4970
Deduced a syphon composed of 220 places in 6 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 2 with 440 rules applied. Total rules applied 460 place count 860 transition count 4970
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 550 place count 770 transition count 4070
Iterating global reduction 2 with 90 rules applied. Total rules applied 640 place count 770 transition count 4070
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 5 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 800 place count 690 transition count 3990
Applied a total of 800 rules in 965 ms. Remains 690 /1090 variables (removed 400) and now considering 3990/5200 (removed 1210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 984 ms. Remains : 690/1090 places, 3990/5200 transitions.
SDD proceeding with computation,368 properties remain. new max is 4096
SDD size :280 after 1831
Invariant property smplace_753 does not hold.
SDD proceeding with computation,367 properties remain. new max is 4096
SDD size :1831 after 4300
Invariant property smplace_791 does not hold.
Invariant property smplace_790 does not hold.
Invariant property smplace_763 does not hold.
SDD proceeding with computation,364 properties remain. new max is 4096
SDD size :4300 after 8859
RANDOM walk for 3244447 steps (8 resets) in 120004 ms. (27 steps per ms) remains 350/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 349/350 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 349/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 347/349 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 347/347 properties
SDD proceeding with computation,364 properties remain. new max is 8192
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 347/347 properties
SDD size :8859 after 40421
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 347/347 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 347/347 properties
SDD proceeding with computation,364 properties remain. new max is 16384
SDD size :40421 after 69453
Invariant property smplace_751 does not hold.
Invariant property smplace_359 does not hold.
SDD proceeding with computation,362 properties remain. new max is 16384
SDD size :69453 after 130655
Invariant property smplace_792 does not hold.
Invariant property smplace_771 does not hold.
Invariant property smplace_770 does not hold.
Invariant property smplace_761 does not hold.
SDD proceeding with computation,358 properties remain. new max is 16384
SDD size :130655 after 207391
Invariant property smplace_773 does not hold.
SDD proceeding with computation,357 properties remain. new max is 16384
SDD size :207391 after 237677
Interrupted probabilistic random walk after 3172796 steps, run timeout after 102001 ms. (steps per millisecond=31 ) properties seen :314 out of 347
Probabilistic random walk after 3172796 steps, saw 1794099 distinct states, run finished after 102030 ms. (steps per millisecond=31 ) properties seen :314
[2024-05-23 18:02:14] [INFO ] Flow matrix only has 1120 transitions (discarded 2870 similar events)
// Phase 1: matrix 1120 rows 690 cols
[2024-05-23 18:02:14] [INFO ] Computed 31 invariants in 9 ms
[2024-05-23 18:02:14] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 564/593 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 18/611 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 1007/1618 variables, 611/638 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1618 variables, 234/872 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1618 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 28/1646 variables, 10/882 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1646 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1646 variables, 106/989 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1646 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 26/1672 variables, 12/1001 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1672 variables, 12/1013 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1672 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 55/1727 variables, 2/1015 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1727 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (OVERLAPS) 2/1729 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1729 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 19 (OVERLAPS) 81/1810 variables, 57/1073 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1810 variables, 84/1157 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1810 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 22 (OVERLAPS) 0/1810 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1810/1810 variables, and 1157 constraints, problems are : Problem set: 0 solved, 29 unsolved in 11855 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 690/690 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 564/593 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 18/611 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-23 18:02:28] [INFO ] Deduced a trap composed of 3 places in 893 ms of which 62 ms to minimize.
[2024-05-23 18:02:29] [INFO ] Deduced a trap composed of 3 places in 712 ms of which 6 ms to minimize.
[2024-05-23 18:02:30] [INFO ] Deduced a trap composed of 3 places in 516 ms of which 6 ms to minimize.
[2024-05-23 18:02:30] [INFO ] Deduced a trap composed of 3 places in 527 ms of which 8 ms to minimize.
[2024-05-23 18:02:31] [INFO ] Deduced a trap composed of 30 places in 474 ms of which 5 ms to minimize.
[2024-05-23 18:02:31] [INFO ] Deduced a trap composed of 68 places in 597 ms of which 5 ms to minimize.
[2024-05-23 18:02:32] [INFO ] Deduced a trap composed of 19 places in 425 ms of which 6 ms to minimize.
[2024-05-23 18:02:32] [INFO ] Deduced a trap composed of 56 places in 352 ms of which 3 ms to minimize.
[2024-05-23 18:02:33] [INFO ] Deduced a trap composed of 16 places in 362 ms of which 5 ms to minimize.
[2024-05-23 18:02:33] [INFO ] Deduced a trap composed of 55 places in 538 ms of which 6 ms to minimize.
[2024-05-23 18:02:34] [INFO ] Deduced a trap composed of 78 places in 403 ms of which 5 ms to minimize.
[2024-05-23 18:02:34] [INFO ] Deduced a trap composed of 29 places in 427 ms of which 5 ms to minimize.
[2024-05-23 18:02:35] [INFO ] Deduced a trap composed of 11 places in 438 ms of which 5 ms to minimize.
[2024-05-23 18:02:35] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 3 ms to minimize.
[2024-05-23 18:02:35] [INFO ] Deduced a trap composed of 79 places in 499 ms of which 5 ms to minimize.
[2024-05-23 18:02:36] [INFO ] Deduced a trap composed of 73 places in 522 ms of which 5 ms to minimize.
[2024-05-23 18:02:36] [INFO ] Deduced a trap composed of 76 places in 513 ms of which 5 ms to minimize.
[2024-05-23 18:02:37] [INFO ] Deduced a trap composed of 74 places in 431 ms of which 4 ms to minimize.
[2024-05-23 18:02:37] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 4 ms to minimize.
[2024-05-23 18:02:38] [INFO ] Deduced a trap composed of 33 places in 334 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-23 18:02:38] [INFO ] Deduced a trap composed of 5 places in 517 ms of which 5 ms to minimize.
[2024-05-23 18:02:39] [INFO ] Deduced a trap composed of 58 places in 424 ms of which 5 ms to minimize.
[2024-05-23 18:02:39] [INFO ] Deduced a trap composed of 57 places in 512 ms of which 4 ms to minimize.
[2024-05-23 18:02:40] [INFO ] Deduced a trap composed of 56 places in 509 ms of which 5 ms to minimize.
[2024-05-23 18:02:40] [INFO ] Deduced a trap composed of 3 places in 518 ms of which 5 ms to minimize.
[2024-05-23 18:02:41] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 3 ms to minimize.
[2024-05-23 18:02:41] [INFO ] Deduced a trap composed of 35 places in 428 ms of which 4 ms to minimize.
[2024-05-23 18:02:42] [INFO ] Deduced a trap composed of 31 places in 496 ms of which 6 ms to minimize.
[2024-05-23 18:02:42] [INFO ] Deduced a trap composed of 15 places in 445 ms of which 4 ms to minimize.
[2024-05-23 18:02:42] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 4 ms to minimize.
[2024-05-23 18:02:43] [INFO ] Deduced a trap composed of 21 places in 355 ms of which 3 ms to minimize.
[2024-05-23 18:02:43] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 5 ms to minimize.
[2024-05-23 18:02:44] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 3 ms to minimize.
[2024-05-23 18:02:44] [INFO ] Deduced a trap composed of 58 places in 421 ms of which 4 ms to minimize.
[2024-05-23 18:02:45] [INFO ] Deduced a trap composed of 101 places in 361 ms of which 9 ms to minimize.
[2024-05-23 18:02:45] [INFO ] Deduced a trap composed of 62 places in 342 ms of which 4 ms to minimize.
[2024-05-23 18:02:45] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 3 ms to minimize.
[2024-05-23 18:02:45] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 4 ms to minimize.
[2024-05-23 18:02:46] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 2 ms to minimize.
[2024-05-23 18:02:46] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-23 18:02:46] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 4 ms to minimize.
[2024-05-23 18:02:47] [INFO ] Deduced a trap composed of 13 places in 448 ms of which 4 ms to minimize.
[2024-05-23 18:02:47] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 2 ms to minimize.
[2024-05-23 18:02:47] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 2 ms to minimize.
[2024-05-23 18:02:48] [INFO ] Deduced a trap composed of 53 places in 258 ms of which 3 ms to minimize.
[2024-05-23 18:02:48] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 3 ms to minimize.
[2024-05-23 18:02:48] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 3 ms to minimize.
[2024-05-23 18:02:48] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 2 ms to minimize.
[2024-05-23 18:02:49] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 2 ms to minimize.
[2024-05-23 18:02:49] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 2 ms to minimize.
[2024-05-23 18:02:49] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 3 ms to minimize.
[2024-05-23 18:02:49] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/611 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-23 18:02:50] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/611 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/611 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1007/1618 variables, 611/691 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1618 variables, 234/925 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1618 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 28/1646 variables, 10/935 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1646 variables, 1/936 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1646 variables, 106/1042 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1646 variables, 18/1060 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-23 18:02:56] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 2 ms to minimize.
[2024-05-23 18:02:57] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-23 18:02:57] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1646 variables, 3/1063 constraints. Problems are: Problem set: 0 solved, 29 unsolved
SDD proceeding with computation,357 properties remain. new max is 32768
SDD size :237677 after 1.02783e+06
At refinement iteration 17 (INCLUDED_ONLY) 0/1646 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 18 (OVERLAPS) 26/1672 variables, 12/1075 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1672 variables, 12/1087 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1672 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 21 (OVERLAPS) 55/1727 variables, 2/1089 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1727 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 23 (OVERLAPS) 2/1729 variables, 1/1090 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1729 variables, 11/1101 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-23 18:03:10] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 16 ms to minimize.
[2024-05-23 18:03:11] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1729/1810 variables, and 1103 constraints, problems are : Problem set: 0 solved, 29 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 633/690 constraints, ReadFeed: 352/436 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 58/58 constraints]
After SMT, in 56928ms problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 3990/3990 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 690 transition count 3900
Deduced a syphon composed of 90 places in 46 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 600 transition count 3900
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 45 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 200 place count 590 transition count 3890
Applied a total of 200 rules in 374 ms. Remains 590 /690 variables (removed 100) and now considering 3890/3990 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 590/690 places, 3890/3990 transitions.
RANDOM walk for 4000000 steps (8 resets) in 38199 ms. (104 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 831 ms. (480 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 755 ms. (529 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1188 ms. (336 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 869 ms. (459 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 686 ms. (582 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 850 ms. (470 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 717 ms. (557 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 680 ms. (587 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1005 ms. (397 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 615 ms. (649 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 840 ms. (475 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 878 ms. (455 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 787 ms. (507 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 621 ms. (643 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 795 ms. (502 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 802 ms. (498 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 610 ms. (654 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 863 ms. (462 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 752 ms. (531 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 935 ms. (427 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 726 ms. (550 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 786 ms. (508 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 616 ms. (648 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 683 ms. (584 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 744 ms. (536 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 918 ms. (435 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 734 ms. (544 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 853 ms. (468 steps per ms) remains 29/29 properties
SDD proceeding with computation,357 properties remain. new max is 65536
SDD size :1.02783e+06 after 1.55184e+06
Interrupted probabilistic random walk after 2009095 steps, run timeout after 57001 ms. (steps per millisecond=35 ) properties seen :7 out of 29
Probabilistic random walk after 2009095 steps, saw 1168203 distinct states, run finished after 57002 ms. (steps per millisecond=35 ) properties seen :7
[2024-05-23 18:04:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:04:28] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 18:04:28] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 482/504 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 18/522 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 918/1440 variables, 522/549 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1440 variables, 234/783 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1440 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 28/1468 variables, 10/793 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1468 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1468 variables, 106/900 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1468 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 26/1494 variables, 12/912 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1494 variables, 12/924 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1494 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 44/1538 variables, 2/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1538 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 2/1540 variables, 1/927 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1540 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 70/1610 variables, 46/973 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 84/1057 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 22 unsolved in 9898 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 482/504 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 18/522 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 18:04:40] [INFO ] Deduced a trap composed of 3 places in 777 ms of which 7 ms to minimize.
[2024-05-23 18:04:40] [INFO ] Deduced a trap composed of 29 places in 764 ms of which 7 ms to minimize.
[2024-05-23 18:04:41] [INFO ] Deduced a trap composed of 4 places in 684 ms of which 7 ms to minimize.
[2024-05-23 18:04:42] [INFO ] Deduced a trap composed of 3 places in 893 ms of which 8 ms to minimize.
[2024-05-23 18:04:43] [INFO ] Deduced a trap composed of 3 places in 892 ms of which 8 ms to minimize.
[2024-05-23 18:04:44] [INFO ] Deduced a trap composed of 28 places in 885 ms of which 9 ms to minimize.
[2024-05-23 18:04:45] [INFO ] Deduced a trap composed of 55 places in 793 ms of which 8 ms to minimize.
[2024-05-23 18:04:45] [INFO ] Deduced a trap composed of 31 places in 759 ms of which 7 ms to minimize.
[2024-05-23 18:04:46] [INFO ] Deduced a trap composed of 3 places in 787 ms of which 7 ms to minimize.
[2024-05-23 18:04:47] [INFO ] Deduced a trap composed of 19 places in 645 ms of which 6 ms to minimize.
[2024-05-23 18:04:48] [INFO ] Deduced a trap composed of 23 places in 651 ms of which 6 ms to minimize.
[2024-05-23 18:04:48] [INFO ] Deduced a trap composed of 11 places in 660 ms of which 6 ms to minimize.
[2024-05-23 18:04:49] [INFO ] Deduced a trap composed of 15 places in 503 ms of which 4 ms to minimize.
[2024-05-23 18:04:49] [INFO ] Deduced a trap composed of 3 places in 324 ms of which 3 ms to minimize.
[2024-05-23 18:04:49] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 2 ms to minimize.
[2024-05-23 18:04:50] [INFO ] Deduced a trap composed of 53 places in 258 ms of which 2 ms to minimize.
[2024-05-23 18:04:50] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 3 ms to minimize.
[2024-05-23 18:04:50] [INFO ] Deduced a trap composed of 27 places in 309 ms of which 3 ms to minimize.
[2024-05-23 18:04:51] [INFO ] Deduced a trap composed of 68 places in 335 ms of which 3 ms to minimize.
[2024-05-23 18:04:51] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 18:04:52] [INFO ] Deduced a trap composed of 3 places in 465 ms of which 5 ms to minimize.
[2024-05-23 18:04:52] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-23 18:04:52] [INFO ] Deduced a trap composed of 33 places in 488 ms of which 4 ms to minimize.
[2024-05-23 18:04:53] [INFO ] Deduced a trap composed of 27 places in 472 ms of which 5 ms to minimize.
[2024-05-23 18:04:53] [INFO ] Deduced a trap composed of 3 places in 395 ms of which 3 ms to minimize.
[2024-05-23 18:04:54] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 3 ms to minimize.
[2024-05-23 18:04:54] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 3 ms to minimize.
[2024-05-23 18:04:54] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 2 ms to minimize.
[2024-05-23 18:04:54] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-23 18:04:55] [INFO ] Deduced a trap composed of 25 places in 408 ms of which 15 ms to minimize.
[2024-05-23 18:04:55] [INFO ] Deduced a trap composed of 21 places in 333 ms of which 4 ms to minimize.
[2024-05-23 18:04:55] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 2 ms to minimize.
[2024-05-23 18:04:55] [INFO ] Deduced a trap composed of 66 places in 171 ms of which 2 ms to minimize.
[2024-05-23 18:04:56] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 2 ms to minimize.
[2024-05-23 18:04:56] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 2 ms to minimize.
[2024-05-23 18:04:56] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 2 ms to minimize.
[2024-05-23 18:04:56] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 3 ms to minimize.
[2024-05-23 18:04:57] [INFO ] Deduced a trap composed of 21 places in 418 ms of which 2 ms to minimize.
[2024-05-23 18:04:57] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 2 ms to minimize.
[2024-05-23 18:04:57] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 18:04:57] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 3 ms to minimize.
[2024-05-23 18:04:57] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 2 ms to minimize.
[2024-05-23 18:04:58] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 2 ms to minimize.
[2024-05-23 18:04:58] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 1 ms to minimize.
[2024-05-23 18:04:58] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-05-23 18:04:58] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 3 ms to minimize.
[2024-05-23 18:04:59] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 918/1440 variables, 522/596 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1440 variables, 234/830 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1440 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 28/1468 variables, 10/840 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1468 variables, 1/841 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1468 variables, 106/947 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1468 variables, 15/962 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 18:05:03] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1468 variables, 1/963 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1468 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 26/1494 variables, 12/975 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1494 variables, 12/987 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 18:05:06] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1494 variables, 1/988 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1494 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (OVERLAPS) 44/1538 variables, 2/990 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1538 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 23 (OVERLAPS) 2/1540 variables, 1/991 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1540 variables, 7/998 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 18:05:12] [INFO ] Deduced a trap composed of 84 places in 747 ms of which 6 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1540 variables, 1/999 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 18:05:15] [INFO ] Deduced a trap composed of 95 places in 680 ms of which 6 ms to minimize.
[2024-05-23 18:05:16] [INFO ] Deduced a trap composed of 90 places in 637 ms of which 5 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1540 variables, 2/1001 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 18:05:18] [INFO ] Deduced a trap composed of 126 places in 672 ms of which 6 ms to minimize.
[2024-05-23 18:05:19] [INFO ] Deduced a trap composed of 17 places in 681 ms of which 5 ms to minimize.
[2024-05-23 18:05:19] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1540 variables, 3/1004 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1540 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 29 (OVERLAPS) 70/1610 variables, 46/1050 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1610 variables, 84/1134 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,357 properties remain. new max is 131072
[2024-05-23 18:05:24] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 2 ms to minimize.
SDD size :1.55184e+06 after 2.51045e+06
At refinement iteration 31 (INCLUDED_ONLY) 0/1610 variables, 1/1135 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1610 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 33 (OVERLAPS) 0/1610 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1135 constraints, problems are : Problem set: 0 solved, 22 unsolved in 51661 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 56/56 constraints]
After SMT, in 61630ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 4 properties in 5171 ms.
Support contains 18 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 209 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 4000000 steps (8 resets) in 35963 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1263 ms. (316 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1013 ms. (394 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1134 ms. (352 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1205 ms. (331 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1203 ms. (332 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1154 ms. (346 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1200 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1159 ms. (344 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1288 ms. (310 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1010 ms. (395 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1016 ms. (393 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 932 ms. (428 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1139 ms. (350 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 960 ms. (416 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 937 ms. (426 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1322 ms. (302 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1006 ms. (397 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1211 ms. (330 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 1385472 steps, run timeout after 51001 ms. (steps per millisecond=27 ) properties seen :0 out of 18
Probabilistic random walk after 1385472 steps, saw 828677 distinct states, run finished after 51002 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-23 18:06:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:06:43] [INFO ] Invariant cache hit.
[2024-05-23 18:06:43] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 430/448 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 16/464 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 816/1280 variables, 464/488 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 184/672 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 46/1326 variables, 10/682 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1326 variables, 94/777 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1326 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 52/1378 variables, 24/801 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1378 variables, 22/823 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1378 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 88/1466 variables, 4/827 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1466 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 4/1470 variables, 2/829 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1470 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 140/1610 variables, 92/921 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 136/1057 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6020 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 430/448 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 16/464 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:06:50] [INFO ] Deduced a trap composed of 3 places in 555 ms of which 5 ms to minimize.
[2024-05-23 18:06:51] [INFO ] Deduced a trap composed of 50 places in 607 ms of which 5 ms to minimize.
[2024-05-23 18:06:52] [INFO ] Deduced a trap composed of 5 places in 520 ms of which 5 ms to minimize.
[2024-05-23 18:06:52] [INFO ] Deduced a trap composed of 64 places in 430 ms of which 4 ms to minimize.
[2024-05-23 18:06:53] [INFO ] Deduced a trap composed of 3 places in 422 ms of which 3 ms to minimize.
[2024-05-23 18:06:53] [INFO ] Deduced a trap composed of 68 places in 509 ms of which 4 ms to minimize.
[2024-05-23 18:06:54] [INFO ] Deduced a trap composed of 15 places in 492 ms of which 4 ms to minimize.
[2024-05-23 18:06:54] [INFO ] Deduced a trap composed of 33 places in 399 ms of which 4 ms to minimize.
[2024-05-23 18:06:54] [INFO ] Deduced a trap composed of 35 places in 382 ms of which 4 ms to minimize.
[2024-05-23 18:06:55] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 4 ms to minimize.
[2024-05-23 18:06:55] [INFO ] Deduced a trap composed of 55 places in 346 ms of which 3 ms to minimize.
[2024-05-23 18:06:55] [INFO ] Deduced a trap composed of 29 places in 340 ms of which 3 ms to minimize.
[2024-05-23 18:06:56] [INFO ] Deduced a trap composed of 92 places in 345 ms of which 3 ms to minimize.
[2024-05-23 18:06:56] [INFO ] Deduced a trap composed of 60 places in 340 ms of which 3 ms to minimize.
[2024-05-23 18:06:57] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 7 ms to minimize.
[2024-05-23 18:06:57] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 2 ms to minimize.
[2024-05-23 18:06:57] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-23 18:06:57] [INFO ] Deduced a trap composed of 29 places in 397 ms of which 4 ms to minimize.
[2024-05-23 18:06:58] [INFO ] Deduced a trap composed of 14 places in 374 ms of which 4 ms to minimize.
[2024-05-23 18:06:58] [INFO ] Deduced a trap composed of 55 places in 294 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:06:58] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 3 ms to minimize.
[2024-05-23 18:06:59] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 2 ms to minimize.
[2024-05-23 18:06:59] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 2 ms to minimize.
[2024-05-23 18:06:59] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 2 ms to minimize.
[2024-05-23 18:06:59] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 1 ms to minimize.
[2024-05-23 18:06:59] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 2 ms to minimize.
[2024-05-23 18:07:00] [INFO ] Deduced a trap composed of 92 places in 352 ms of which 3 ms to minimize.
[2024-05-23 18:07:00] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 4 ms to minimize.
[2024-05-23 18:07:00] [INFO ] Deduced a trap composed of 53 places in 257 ms of which 3 ms to minimize.
[2024-05-23 18:07:01] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 3 ms to minimize.
[2024-05-23 18:07:01] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 2 ms to minimize.
[2024-05-23 18:07:01] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2024-05-23 18:07:01] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 3 ms to minimize.
[2024-05-23 18:07:01] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 3 ms to minimize.
[2024-05-23 18:07:02] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 2 ms to minimize.
[2024-05-23 18:07:02] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-05-23 18:07:02] [INFO ] Deduced a trap composed of 55 places in 371 ms of which 4 ms to minimize.
[2024-05-23 18:07:03] [INFO ] Deduced a trap composed of 53 places in 363 ms of which 3 ms to minimize.
[2024-05-23 18:07:03] [INFO ] Deduced a trap composed of 26 places in 310 ms of which 4 ms to minimize.
[2024-05-23 18:07:03] [INFO ] Deduced a trap composed of 21 places in 374 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:07:04] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 3 ms to minimize.
[2024-05-23 18:07:04] [INFO ] Deduced a trap composed of 30 places in 366 ms of which 3 ms to minimize.
[2024-05-23 18:07:04] [INFO ] Deduced a trap composed of 13 places in 368 ms of which 3 ms to minimize.
[2024-05-23 18:07:04] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-05-23 18:07:05] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 2 ms to minimize.
[2024-05-23 18:07:05] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 3 ms to minimize.
[2024-05-23 18:07:05] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 3 ms to minimize.
[2024-05-23 18:07:05] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 1 ms to minimize.
[2024-05-23 18:07:06] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:07:06] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 816/1280 variables, 464/538 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 184/722 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:07:08] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1280 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1280 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 46/1326 variables, 10/733 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1326 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1326 variables, 94/828 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1326 variables, 14/842 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:07:11] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-05-23 18:07:11] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1326 variables, 2/844 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1326 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 52/1378 variables, 24/868 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 22/890 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (OVERLAPS) 88/1466 variables, 4/894 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1466 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (OVERLAPS) 4/1470 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1470 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:07:16] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 2 ms to minimize.
[2024-05-23 18:07:16] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-23 18:07:17] [INFO ] Deduced a trap composed of 45 places in 697 ms of which 6 ms to minimize.
[2024-05-23 18:07:17] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-05-23 18:07:18] [INFO ] Deduced a trap composed of 73 places in 698 ms of which 6 ms to minimize.
[2024-05-23 18:07:19] [INFO ] Deduced a trap composed of 89 places in 661 ms of which 6 ms to minimize.
[2024-05-23 18:07:19] [INFO ] Deduced a trap composed of 89 places in 709 ms of which 5 ms to minimize.
[2024-05-23 18:07:20] [INFO ] Deduced a trap composed of 85 places in 651 ms of which 6 ms to minimize.
[2024-05-23 18:07:21] [INFO ] Deduced a trap composed of 72 places in 650 ms of which 5 ms to minimize.
[2024-05-23 18:07:21] [INFO ] Deduced a trap composed of 72 places in 525 ms of which 5 ms to minimize.
[2024-05-23 18:07:22] [INFO ] Deduced a trap composed of 73 places in 566 ms of which 5 ms to minimize.
[2024-05-23 18:07:23] [INFO ] Deduced a trap composed of 75 places in 563 ms of which 5 ms to minimize.
[2024-05-23 18:07:23] [INFO ] Deduced a trap composed of 81 places in 610 ms of which 5 ms to minimize.
[2024-05-23 18:07:24] [INFO ] Deduced a trap composed of 80 places in 571 ms of which 5 ms to minimize.
[2024-05-23 18:07:24] [INFO ] Deduced a trap composed of 94 places in 637 ms of which 5 ms to minimize.
[2024-05-23 18:07:25] [INFO ] Deduced a trap composed of 72 places in 622 ms of which 5 ms to minimize.
[2024-05-23 18:07:26] [INFO ] Deduced a trap composed of 84 places in 622 ms of which 5 ms to minimize.
[2024-05-23 18:07:26] [INFO ] Deduced a trap composed of 75 places in 562 ms of which 5 ms to minimize.
[2024-05-23 18:07:27] [INFO ] Deduced a trap composed of 74 places in 584 ms of which 5 ms to minimize.
[2024-05-23 18:07:28] [INFO ] Deduced a trap composed of 75 places in 525 ms of which 5 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1470 variables, 20/920 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:07:29] [INFO ] Deduced a trap composed of 60 places in 654 ms of which 5 ms to minimize.
[2024-05-23 18:07:29] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2024-05-23 18:07:30] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 1 ms to minimize.
[2024-05-23 18:07:30] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 1 ms to minimize.
[2024-05-23 18:07:30] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 1 ms to minimize.
[2024-05-23 18:07:31] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1470 variables, 6/926 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:07:32] [INFO ] Deduced a trap composed of 73 places in 698 ms of which 15 ms to minimize.
[2024-05-23 18:07:33] [INFO ] Deduced a trap composed of 84 places in 705 ms of which 11 ms to minimize.
[2024-05-23 18:07:34] [INFO ] Deduced a trap composed of 74 places in 503 ms of which 5 ms to minimize.
[2024-05-23 18:07:34] [INFO ] Deduced a trap composed of 82 places in 605 ms of which 5 ms to minimize.
[2024-05-23 18:07:35] [INFO ] Deduced a trap composed of 79 places in 558 ms of which 5 ms to minimize.
[2024-05-23 18:07:36] [INFO ] Deduced a trap composed of 73 places in 554 ms of which 5 ms to minimize.
[2024-05-23 18:07:36] [INFO ] Deduced a trap composed of 75 places in 520 ms of which 5 ms to minimize.
[2024-05-23 18:07:37] [INFO ] Deduced a trap composed of 75 places in 515 ms of which 5 ms to minimize.
[2024-05-23 18:07:37] [INFO ] Deduced a trap composed of 74 places in 472 ms of which 5 ms to minimize.
[2024-05-23 18:07:38] [INFO ] Deduced a trap composed of 72 places in 509 ms of which 5 ms to minimize.
[2024-05-23 18:07:38] [INFO ] Deduced a trap composed of 75 places in 460 ms of which 5 ms to minimize.
[2024-05-23 18:07:39] [INFO ] Deduced a trap composed of 74 places in 476 ms of which 5 ms to minimize.
[2024-05-23 18:07:39] [INFO ] Deduced a trap composed of 72 places in 426 ms of which 5 ms to minimize.
[2024-05-23 18:07:40] [INFO ] Deduced a trap composed of 96 places in 618 ms of which 5 ms to minimize.
[2024-05-23 18:07:41] [INFO ] Deduced a trap composed of 79 places in 618 ms of which 6 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1470 variables, 15/941 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:07:43] [INFO ] Deduced a trap composed of 77 places in 644 ms of which 5 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1470 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1470 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 31 (OVERLAPS) 140/1610 variables, 92/1034 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1610 variables, 136/1170 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1610 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 18:07:50] [INFO ] Deduced a trap composed of 75 places in 686 ms of which 6 ms to minimize.
[2024-05-23 18:07:51] [INFO ] Deduced a trap composed of 79 places in 658 ms of which 7 ms to minimize.
[2024-05-23 18:07:51] [INFO ] Deduced a trap composed of 74 places in 597 ms of which 5 ms to minimize.
[2024-05-23 18:07:52] [INFO ] Deduced a trap composed of 76 places in 553 ms of which 6 ms to minimize.
[2024-05-23 18:07:53] [INFO ] Deduced a trap composed of 75 places in 514 ms of which 5 ms to minimize.
[2024-05-23 18:07:53] [INFO ] Deduced a trap composed of 75 places in 521 ms of which 5 ms to minimize.
[2024-05-23 18:07:54] [INFO ] Deduced a trap composed of 86 places in 490 ms of which 5 ms to minimize.
[2024-05-23 18:07:54] [INFO ] Deduced a trap composed of 76 places in 441 ms of which 4 ms to minimize.
[2024-05-23 18:07:55] [INFO ] Deduced a trap composed of 86 places in 508 ms of which 4 ms to minimize.
[2024-05-23 18:07:55] [INFO ] Deduced a trap composed of 91 places in 401 ms of which 4 ms to minimize.
Invariant property smplace_793 does not hold.
Invariant property smplace_781 does not hold.
Invariant property smplace_780 does not hold.
Invariant property smplace_762 does not hold.
Invariant property smplace_752 does not hold.
[2024-05-23 18:07:56] [INFO ] Deduced a trap composed of 3 places in 521 ms of which 5 ms to minimize.
At refinement iteration 34 (OVERLAPS) 0/1610 variables, 11/1181 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-23 18:07:58] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-23 18:07:58] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 4 ms to minimize.
[2024-05-23 18:07:58] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 2 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1610 variables, 3/1184 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1610 variables, 0/1184 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 37 (OVERLAPS) 0/1610 variables, 0/1184 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1184 constraints, problems are : Problem set: 1 solved, 17 unsolved in 74976 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 109/109 constraints]
After SMT, in 81042ms problems are : Problem set: 1 solved, 17 unsolved
Parikh walk visited 0 properties in 6234 ms.
Support contains 17 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 206 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 590/590 places, 3890/3890 transitions.
SDD proceeding with computation,352 properties remain. new max is 131072
SDD size :2.51045e+06 after 3.82483e+06
RANDOM walk for 4000000 steps (8 resets) in 54597 ms. (73 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1087 ms. (367 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1176 ms. (339 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1023 ms. (390 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1026 ms. (389 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1138 ms. (351 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1128 ms. (354 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1243 ms. (321 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1120 ms. (356 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1024 ms. (390 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1101 ms. (362 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1135 ms. (352 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 987 ms. (404 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 971 ms. (411 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1333 ms. (299 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1097 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1021 ms. (391 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 932 ms. (428 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 1865853 steps, run timeout after 63001 ms. (steps per millisecond=29 ) properties seen :0 out of 17
Probabilistic random walk after 1865853 steps, saw 1088102 distinct states, run finished after 63002 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-23 18:09:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:09:35] [INFO ] Invariant cache hit.
[2024-05-23 18:09:35] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 431/448 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/464 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 816/1280 variables, 464/488 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 184/672 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 46/1326 variables, 10/682 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1326 variables, 94/777 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1326 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 52/1378 variables, 24/801 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1378 variables, 22/823 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1378 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 88/1466 variables, 4/827 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1466 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 4/1470 variables, 2/829 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1470 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 140/1610 variables, 92/921 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 136/1057 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 17 unsolved in 4744 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 431/448 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/464 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 18:09:41] [INFO ] Deduced a trap composed of 74 places in 594 ms of which 5 ms to minimize.
[2024-05-23 18:09:42] [INFO ] Deduced a trap composed of 25 places in 572 ms of which 4 ms to minimize.
[2024-05-23 18:09:42] [INFO ] Deduced a trap composed of 3 places in 467 ms of which 4 ms to minimize.
[2024-05-23 18:09:43] [INFO ] Deduced a trap composed of 23 places in 465 ms of which 4 ms to minimize.
[2024-05-23 18:09:43] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 4 ms to minimize.
[2024-05-23 18:09:43] [INFO ] Deduced a trap composed of 3 places in 394 ms of which 3 ms to minimize.
[2024-05-23 18:09:44] [INFO ] Deduced a trap composed of 55 places in 535 ms of which 4 ms to minimize.
[2024-05-23 18:09:45] [INFO ] Deduced a trap composed of 3 places in 615 ms of which 5 ms to minimize.
[2024-05-23 18:09:45] [INFO ] Deduced a trap composed of 17 places in 388 ms of which 5 ms to minimize.
[2024-05-23 18:09:45] [INFO ] Deduced a trap composed of 3 places in 454 ms of which 4 ms to minimize.
[2024-05-23 18:09:46] [INFO ] Deduced a trap composed of 37 places in 383 ms of which 3 ms to minimize.
[2024-05-23 18:09:46] [INFO ] Deduced a trap composed of 29 places in 391 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2024-05-23 18:09:47] [INFO ] Deduced a trap composed of 34 places in 511 ms of which 4 ms to minimize.
[2024-05-23 18:09:47] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 4 ms to minimize.
[2024-05-23 18:09:47] [INFO ] Flatten gal took : 230 ms
[2024-05-23 18:09:47] [INFO ] Applying decomposition
[2024-05-23 18:09:47] [INFO ] Flatten gal took : 203 ms
[2024-05-23 18:09:47] [INFO ] Deduced a trap composed of 23 places in 324 ms of which 4 ms to minimize.
[2024-05-23 18:09:48] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:09:48] [INFO ] Deduced a trap composed of 92 places in 299 ms of which 3 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3808304649306643772.txt' '-o' '/tmp/graph3808304649306643772.bin' '-w' '/tmp/graph3808304649306643772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3808304649306643772.bin' '-l' '-1' '-v' '-w' '/tmp/graph3808304649306643772.weights' '-q' '0' '-e' '0.001'
[2024-05-23 18:09:48] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 3 ms to minimize.
[2024-05-23 18:09:48] [INFO ] Decomposing Gal with order
[2024-05-23 18:09:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 18:09:49] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 3 ms to minimize.
[2024-05-23 18:09:49] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 18:09:49] [INFO ] Deduced a trap composed of 37 places in 319 ms of which 3 ms to minimize.
[2024-05-23 18:09:49] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 3 ms to minimize.
[2024-05-23 18:09:50] [INFO ] Removed a total of 10923 redundant transitions.
[2024-05-23 18:09:50] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 3 ms to minimize.
[2024-05-23 18:09:50] [INFO ] Flatten gal took : 1068 ms
[2024-05-23 18:09:50] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 3 ms to minimize.
[2024-05-23 18:09:50] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 3 ms to minimize.
[2024-05-23 18:09:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 421 labels/synchronizations in 258 ms.
[2024-05-23 18:09:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4788617538757983581.gal : 133 ms
[2024-05-23 18:09:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11198325449851527021.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4788617538757983581.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11198325449851527021.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2024-05-23 18:09:51] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 7 ms to minimize.
[2024-05-23 18:09:51] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 3 ms to minimize.
[2024-05-23 18:09:51] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 3 ms to minimize.
[2024-05-23 18:09:52] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 3 ms to minimize.
Loading property file /tmp/ReachabilityCardinality11198325449851527021.prop.
[2024-05-23 18:09:52] [INFO ] Deduced a trap composed of 53 places in 281 ms of which 3 ms to minimize.
[2024-05-23 18:09:52] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 3 ms to minimize.
SDD proceeding with computation,17 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,17 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,17 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,17 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,17 properties remain. new max is 64
SDD size :1 after 2
SDD proceeding with computation,17 properties remain. new max is 128
SDD size :2 after 4
[2024-05-23 18:09:52] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 2 ms to minimize.
[2024-05-23 18:09:52] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
SDD proceeding with computation,17 properties remain. new max is 256
SDD size :4 after 64
[2024-05-23 18:09:53] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 1 ms to minimize.
SDD proceeding with computation,17 properties remain. new max is 512
SDD size :64 after 220
[2024-05-23 18:09:53] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-23 18:09:53] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 2 ms to minimize.
SDD proceeding with computation,17 properties remain. new max is 1024
SDD size :220 after 18864
[2024-05-23 18:09:53] [INFO ] Deduced a trap composed of 28 places in 450 ms of which 3 ms to minimize.
[2024-05-23 18:09:54] [INFO ] Deduced a trap composed of 23 places in 353 ms of which 3 ms to minimize.
[2024-05-23 18:09:54] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 3 ms to minimize.
SDD proceeding with computation,17 properties remain. new max is 2048
SDD size :18864 after 42052
[2024-05-23 18:09:54] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 18:09:54] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-23 18:09:55] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-05-23 18:09:55] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 2 ms to minimize.
[2024-05-23 18:09:55] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 1 ms to minimize.
[2024-05-23 18:09:55] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2024-05-23 18:09:55] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 1 ms to minimize.
[2024-05-23 18:09:56] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 18:09:56] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 816/1280 variables, 464/536 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 184/720 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 18:09:58] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1280 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1280 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 46/1326 variables, 10/731 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1326 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1326 variables, 94/826 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1326 variables, 14/840 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 18:10:00] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1326 variables, 1/841 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 18:10:01] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2024-05-23 18:10:02] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 2 ms to minimize.
[2024-05-23 18:10:02] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1326 variables, 3/844 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 18:10:03] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1326 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 52/1378 variables, 24/869 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1378 variables, 22/891 constraints. Problems are: Problem set: 0 solved, 17 unsolved
SDD proceeding with computation,17 properties remain. new max is 4096
SDD size :42052 after 1.97918e+06
At refinement iteration 23 (INCLUDED_ONLY) 0/1378 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 88/1466 variables, 4/895 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1466 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (OVERLAPS) 4/1470 variables, 2/897 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1470 variables, 3/900 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 18:10:08] [INFO ] Deduced a trap composed of 96 places in 794 ms of which 5 ms to minimize.
[2024-05-23 18:10:08] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 2 ms to minimize.
[2024-05-23 18:10:09] [INFO ] Deduced a trap composed of 84 places in 742 ms of which 6 ms to minimize.
[2024-05-23 18:10:10] [INFO ] Deduced a trap composed of 98 places in 720 ms of which 5 ms to minimize.
[2024-05-23 18:10:11] [INFO ] Deduced a trap composed of 95 places in 700 ms of which 6 ms to minimize.
[2024-05-23 18:10:11] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-05-23 18:10:11] [INFO ] Deduced a trap composed of 64 places in 674 ms of which 5 ms to minimize.
[2024-05-23 18:10:12] [INFO ] Deduced a trap composed of 125 places in 683 ms of which 6 ms to minimize.
[2024-05-23 18:10:12] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 92 places in 679 ms of which 5 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 1 ms to minimize.
[2024-05-23 18:10:13] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 2 ms to minimize.
[2024-05-23 18:10:14] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 2 ms to minimize.
[2024-05-23 18:10:14] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 1 ms to minimize.
[2024-05-23 18:10:15] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 2 ms to minimize.
[2024-05-23 18:10:15] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1470 variables, 16/916 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1470 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (OVERLAPS) 140/1610 variables, 92/1008 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1610 variables, 136/1144 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1610 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 0/1610 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1144 constraints, problems are : Problem set: 0 solved, 17 unsolved in 40535 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 70/70 constraints]
After SMT, in 45320ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 3985 ms.
Support contains 17 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 179 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 180 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:10:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:10:25] [INFO ] Invariant cache hit.
[2024-05-23 18:10:26] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2024-05-23 18:10:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:10:26] [INFO ] Invariant cache hit.
[2024-05-23 18:10:26] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:10:32] [INFO ] Implicit Places using invariants and state equation in 5693 ms returned []
Implicit Place search using SMT with State Equation took 6782 ms to find 0 implicit places.
[2024-05-23 18:10:32] [INFO ] Redundant transitions in 373 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:10:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:10:32] [INFO ] Invariant cache hit.
[2024-05-23 18:10:32] [INFO ] State equation strengthened by 436 read => feed constraints.
SDD proceeding with computation,17 properties remain. new max is 8192
SDD size :1.97918e+06 after 2.81925e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34876ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34953ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42320 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 400000 steps (8 resets) in 8897 ms. (44 steps per ms) remains 17/17 properties
Running SMT prover for 17 properties.
[2024-05-23 18:11:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:11:10] [INFO ] Invariant cache hit.
[2024-05-23 18:11:10] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2024-05-23 18:11:10] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-23 18:11:11] [INFO ] After 429ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2024-05-23 18:11:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:11:11] [INFO ] After 226ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :17
TRAPS : Iteration 0
[2024-05-23 18:11:12] [INFO ] After 1560ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-23 18:11:12] [INFO ] After 2210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-23 18:11:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2024-05-23 18:11:12] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-23 18:11:13] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-23 18:11:13] [INFO ] After 308ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :17
TRAPS : Iteration 0
[2024-05-23 18:11:14] [INFO ] Deduced a trap composed of 63 places in 474 ms of which 5 ms to minimize.
[2024-05-23 18:11:14] [INFO ] Deduced a trap composed of 23 places in 466 ms of which 4 ms to minimize.
[2024-05-23 18:11:15] [INFO ] Deduced a trap composed of 3 places in 463 ms of which 5 ms to minimize.
[2024-05-23 18:11:15] [INFO ] Deduced a trap composed of 41 places in 471 ms of which 4 ms to minimize.
[2024-05-23 18:11:16] [INFO ] Deduced a trap composed of 70 places in 467 ms of which 5 ms to minimize.
[2024-05-23 18:11:16] [INFO ] Deduced a trap composed of 34 places in 559 ms of which 5 ms to minimize.
[2024-05-23 18:11:17] [INFO ] Deduced a trap composed of 16 places in 468 ms of which 4 ms to minimize.
[2024-05-23 18:11:17] [INFO ] Deduced a trap composed of 26 places in 385 ms of which 3 ms to minimize.
[2024-05-23 18:11:18] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 3 ms to minimize.
[2024-05-23 18:11:18] [INFO ] Deduced a trap composed of 3 places in 551 ms of which 4 ms to minimize.
[2024-05-23 18:11:19] [INFO ] Deduced a trap composed of 59 places in 456 ms of which 4 ms to minimize.
[2024-05-23 18:11:19] [INFO ] Deduced a trap composed of 26 places in 478 ms of which 5 ms to minimize.
[2024-05-23 18:11:20] [INFO ] Deduced a trap composed of 17 places in 479 ms of which 4 ms to minimize.
[2024-05-23 18:11:20] [INFO ] Deduced a trap composed of 33 places in 462 ms of which 5 ms to minimize.
[2024-05-23 18:11:21] [INFO ] Deduced a trap composed of 55 places in 456 ms of which 4 ms to minimize.
[2024-05-23 18:11:21] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 3 ms to minimize.
[2024-05-23 18:11:21] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-23 18:11:22] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 8371 ms
[2024-05-23 18:11:22] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 3 ms to minimize.
[2024-05-23 18:11:22] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 2 ms to minimize.
[2024-05-23 18:11:22] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 2 ms to minimize.
[2024-05-23 18:11:23] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 2 ms to minimize.
[2024-05-23 18:11:23] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
[2024-05-23 18:11:23] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 2 ms to minimize.
[2024-05-23 18:11:23] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-23 18:11:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1697 ms
[2024-05-23 18:11:23] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
[2024-05-23 18:11:24] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-23 18:11:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2024-05-23 18:11:24] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 1 ms to minimize.
[2024-05-23 18:11:24] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-23 18:11:24] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-23 18:11:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 529 ms
[2024-05-23 18:11:24] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-05-23 18:11:25] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-23 18:11:25] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 2 ms to minimize.
[2024-05-23 18:11:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 532 ms
[2024-05-23 18:11:25] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 3 ms to minimize.
[2024-05-23 18:11:25] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-23 18:11:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 448 ms
[2024-05-23 18:11:26] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2024-05-23 18:11:26] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-23 18:11:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2024-05-23 18:11:26] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-23 18:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-05-23 18:11:27] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2024-05-23 18:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-23 18:11:27] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
[2024-05-23 18:11:27] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2024-05-23 18:11:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
TRAPS : Iteration 1
[2024-05-23 18:11:27] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 1 ms to minimize.
[2024-05-23 18:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2024-05-23 18:11:28] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-23 18:11:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-05-23 18:11:28] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-23 18:11:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-05-23 18:11:29] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2024-05-23 18:11:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2024-05-23 18:11:29] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 3 ms to minimize.
[2024-05-23 18:11:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
TRAPS : Iteration 2
[2024-05-23 18:11:30] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-23 18:11:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-05-23 18:11:30] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-23 18:11:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-23 18:11:30] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 1 ms to minimize.
[2024-05-23 18:11:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
TRAPS : Iteration 3
[2024-05-23 18:11:32] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-05-23 18:11:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2024-05-23 18:11:33] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-23 18:11:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
TRAPS : Iteration 4
[2024-05-23 18:11:34] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 3 ms to minimize.
[2024-05-23 18:11:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2024-05-23 18:11:34] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-05-23 18:11:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
TRAPS : Iteration 5
[2024-05-23 18:11:36] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2024-05-23 18:11:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
TRAPS : Iteration 6
[2024-05-23 18:11:37] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 2 ms to minimize.
[2024-05-23 18:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
TRAPS : Iteration 7
[2024-05-23 18:11:40] [INFO ] After 27357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
[2024-05-23 18:11:40] [INFO ] After 28222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
RANDOM walk for 4000000 steps (8 resets) in 67064 ms. (59 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1254 ms. (318 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1247 ms. (320 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1156 ms. (345 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1274 ms. (313 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1021 ms. (391 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 949 ms. (421 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1170 ms. (341 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1440 ms. (277 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1123 ms. (355 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1325 ms. (301 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1367 ms. (292 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1109 ms. (360 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1115 ms. (358 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1083 ms. (369 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 937 ms. (426 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1209 ms. (330 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1325 ms. (301 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 3278858 steps, run timeout after 90001 ms. (steps per millisecond=36 ) properties seen :2 out of 17
Probabilistic random walk after 3278858 steps, saw 1815719 distinct states, run finished after 90002 ms. (steps per millisecond=36 ) properties seen :2
[2024-05-23 18:13:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:13:41] [INFO ] Invariant cache hit.
[2024-05-23 18:13:41] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 377/392 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/406 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 714/1120 variables, 406/427 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1120 variables, 140/567 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1120 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 64/1184 variables, 10/577 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1184 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1184 variables, 82/660 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1184 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 78/1262 variables, 36/696 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1262 variables, 30/726 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1262 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 132/1394 variables, 6/732 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1394 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 6/1400 variables, 3/735 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1400 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 210/1610 variables, 138/873 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 184/1057 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3889 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 377/392 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/406 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 18:13:46] [INFO ] Deduced a trap composed of 3 places in 451 ms of which 5 ms to minimize.
[2024-05-23 18:13:47] [INFO ] Deduced a trap composed of 3 places in 451 ms of which 4 ms to minimize.
[2024-05-23 18:13:47] [INFO ] Deduced a trap composed of 65 places in 364 ms of which 3 ms to minimize.
[2024-05-23 18:13:47] [INFO ] Deduced a trap composed of 22 places in 361 ms of which 3 ms to minimize.
[2024-05-23 18:13:48] [INFO ] Deduced a trap composed of 15 places in 364 ms of which 4 ms to minimize.
[2024-05-23 18:13:48] [INFO ] Deduced a trap composed of 3 places in 303 ms of which 3 ms to minimize.
[2024-05-23 18:13:48] [INFO ] Deduced a trap composed of 51 places in 297 ms of which 3 ms to minimize.
[2024-05-23 18:13:49] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 4 ms to minimize.
[2024-05-23 18:13:49] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 3 ms to minimize.
[2024-05-23 18:13:49] [INFO ] Deduced a trap composed of 92 places in 307 ms of which 3 ms to minimize.
[2024-05-23 18:13:49] [INFO ] Deduced a trap composed of 51 places in 284 ms of which 3 ms to minimize.
[2024-05-23 18:13:50] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 3 ms to minimize.
[2024-05-23 18:13:50] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-23 18:13:50] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2024-05-23 18:13:50] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 2 ms to minimize.
[2024-05-23 18:13:51] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2024-05-23 18:13:51] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 2 ms to minimize.
[2024-05-23 18:13:51] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2024-05-23 18:13:51] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 2 ms to minimize.
[2024-05-23 18:13:51] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 18:13:52] [INFO ] Deduced a trap composed of 3 places in 352 ms of which 4 ms to minimize.
[2024-05-23 18:13:52] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 3 ms to minimize.
[2024-05-23 18:13:52] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 3 ms to minimize.
[2024-05-23 18:13:52] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 3 ms to minimize.
[2024-05-23 18:13:53] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
[2024-05-23 18:13:53] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-23 18:13:53] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2024-05-23 18:13:53] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 2 ms to minimize.
[2024-05-23 18:13:53] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 2 ms to minimize.
[2024-05-23 18:13:54] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 2 ms to minimize.
[2024-05-23 18:13:54] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 2 ms to minimize.
[2024-05-23 18:13:54] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 2 ms to minimize.
[2024-05-23 18:13:54] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 1 ms to minimize.
[2024-05-23 18:13:54] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
[2024-05-23 18:13:55] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 714/1120 variables, 406/462 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1120 variables, 140/602 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1120 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 64/1184 variables, 10/612 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1184 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1184 variables, 82/695 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1184 variables, 12/707 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 18:13:57] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1184 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1184 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 78/1262 variables, 36/744 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1262 variables, 30/774 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 132/1394 variables, 6/780 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1394 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 6/1400 variables, 3/783 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1400 variables, 3/786 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1400 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (OVERLAPS) 210/1610 variables, 138/924 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 184/1108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1610 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (OVERLAPS) 0/1610 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1108 constraints, problems are : Problem set: 0 solved, 15 unsolved in 18152 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 36/36 constraints]
After SMT, in 22081ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 1 properties in 32067 ms.
Support contains 14 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 202 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 4000000 steps (8 resets) in 58329 ms. (68 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10184 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10755 ms. (371 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 9042 ms. (442 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 9315 ms. (429 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 8156 ms. (490 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 8964 ms. (446 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 8806 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 9120 ms. (438 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10333 ms. (387 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 9731 ms. (411 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 9065 ms. (441 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 8319 ms. (480 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10307 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 8595 ms. (465 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 7077356 steps, run timeout after 195001 ms. (steps per millisecond=36 ) properties seen :0 out of 14
Probabilistic random walk after 7077356 steps, saw 3598546 distinct states, run finished after 195002 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-23 18:18:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:18:56] [INFO ] Invariant cache hit.
[2024-05-23 18:18:56] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 378/392 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 14/406 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 714/1120 variables, 406/427 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1120 variables, 140/567 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1120 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 64/1184 variables, 10/577 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1184 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1184 variables, 82/660 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1184 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 78/1262 variables, 36/696 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1262 variables, 30/726 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1262 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 132/1394 variables, 6/732 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1394 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 6/1400 variables, 3/735 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1400 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 210/1610 variables, 138/873 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 184/1057 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3894 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 378/392 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 14/406 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:19:02] [INFO ] Deduced a trap composed of 3 places in 524 ms of which 4 ms to minimize.
[2024-05-23 18:19:02] [INFO ] Deduced a trap composed of 13 places in 402 ms of which 4 ms to minimize.
[2024-05-23 18:19:02] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 3 ms to minimize.
[2024-05-23 18:19:03] [INFO ] Deduced a trap composed of 3 places in 414 ms of which 4 ms to minimize.
[2024-05-23 18:19:03] [INFO ] Deduced a trap composed of 3 places in 419 ms of which 4 ms to minimize.
[2024-05-23 18:19:04] [INFO ] Deduced a trap composed of 27 places in 417 ms of which 4 ms to minimize.
[2024-05-23 18:19:04] [INFO ] Deduced a trap composed of 33 places in 369 ms of which 4 ms to minimize.
[2024-05-23 18:19:05] [INFO ] Deduced a trap composed of 51 places in 409 ms of which 3 ms to minimize.
[2024-05-23 18:19:05] [INFO ] Deduced a trap composed of 35 places in 330 ms of which 3 ms to minimize.
[2024-05-23 18:19:05] [INFO ] Deduced a trap composed of 55 places in 332 ms of which 3 ms to minimize.
[2024-05-23 18:19:06] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 3 ms to minimize.
[2024-05-23 18:19:06] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 3 ms to minimize.
[2024-05-23 18:19:06] [INFO ] Deduced a trap composed of 50 places in 399 ms of which 3 ms to minimize.
[2024-05-23 18:19:07] [INFO ] Deduced a trap composed of 55 places in 307 ms of which 3 ms to minimize.
[2024-05-23 18:19:07] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 3 ms to minimize.
[2024-05-23 18:19:07] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 2 ms to minimize.
[2024-05-23 18:19:07] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 2 ms to minimize.
[2024-05-23 18:19:07] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2024-05-23 18:19:08] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 2 ms to minimize.
[2024-05-23 18:19:08] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:19:08] [INFO ] Deduced a trap composed of 3 places in 343 ms of which 3 ms to minimize.
[2024-05-23 18:19:08] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 2 ms to minimize.
[2024-05-23 18:19:09] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 3 ms to minimize.
[2024-05-23 18:19:09] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 2 ms to minimize.
[2024-05-23 18:19:09] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 2 ms to minimize.
[2024-05-23 18:19:09] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 2 ms to minimize.
[2024-05-23 18:19:10] [INFO ] Deduced a trap composed of 26 places in 413 ms of which 4 ms to minimize.
[2024-05-23 18:19:10] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 4 ms to minimize.
[2024-05-23 18:19:11] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 3 ms to minimize.
[2024-05-23 18:19:11] [INFO ] Deduced a trap composed of 30 places in 334 ms of which 3 ms to minimize.
[2024-05-23 18:19:11] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 3 ms to minimize.
[2024-05-23 18:19:11] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2024-05-23 18:19:12] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-23 18:19:12] [INFO ] Deduced a trap composed of 23 places in 411 ms of which 3 ms to minimize.
[2024-05-23 18:19:12] [INFO ] Deduced a trap composed of 21 places in 399 ms of which 4 ms to minimize.
[2024-05-23 18:19:13] [INFO ] Deduced a trap composed of 15 places in 411 ms of which 4 ms to minimize.
[2024-05-23 18:19:13] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2024-05-23 18:19:13] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 2 ms to minimize.
[2024-05-23 18:19:14] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 714/1120 variables, 406/466 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1120 variables, 140/606 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:19:15] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 3 ms to minimize.
[2024-05-23 18:19:16] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 2 ms to minimize.
[2024-05-23 18:19:16] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1120 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1120 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 64/1184 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1184 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1184 variables, 82/702 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1184 variables, 12/714 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1184 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 78/1262 variables, 36/750 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1262 variables, 30/780 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 132/1394 variables, 6/786 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:19:21] [INFO ] Deduced a trap composed of 126 places in 1095 ms of which 8 ms to minimize.
[2024-05-23 18:19:22] [INFO ] Deduced a trap composed of 126 places in 1071 ms of which 9 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1394 variables, 2/788 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1394 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 6/1400 variables, 3/791 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1400 variables, 2/793 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:19:24] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1400 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:19:26] [INFO ] Deduced a trap composed of 21 places in 854 ms of which 8 ms to minimize.
[2024-05-23 18:19:27] [INFO ] Deduced a trap composed of 101 places in 793 ms of which 7 ms to minimize.
[2024-05-23 18:19:27] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 2 ms to minimize.
[2024-05-23 18:19:28] [INFO ] Deduced a trap composed of 25 places in 861 ms of which 8 ms to minimize.
[2024-05-23 18:19:29] [INFO ] Deduced a trap composed of 75 places in 969 ms of which 8 ms to minimize.
[2024-05-23 18:19:30] [INFO ] Deduced a trap composed of 65 places in 944 ms of which 8 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1400 variables, 6/800 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:19:32] [INFO ] Deduced a trap composed of 53 places in 904 ms of which 7 ms to minimize.
[2024-05-23 18:19:33] [INFO ] Deduced a trap composed of 29 places in 902 ms of which 7 ms to minimize.
[2024-05-23 18:19:34] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1400 variables, 3/803 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1400 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (OVERLAPS) 210/1610 variables, 138/941 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1610 variables, 184/1125 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 18:19:37] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2024-05-23 18:19:38] [INFO ] Deduced a trap composed of 99 places in 708 ms of which 6 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1610 variables, 2/1127 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1610 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (OVERLAPS) 0/1610 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1127 constraints, problems are : Problem set: 0 solved, 14 unsolved in 41919 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 56/56 constraints]
After SMT, in 45854ms problems are : Problem set: 0 solved, 14 unsolved
Detected timeout of ITS tools.
Parikh walk visited 0 properties in 25035 ms.
Support contains 14 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 169 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 166 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:20:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:20:08] [INFO ] Invariant cache hit.
[2024-05-23 18:20:09] [INFO ] Implicit Places using invariants in 1593 ms returned []
[2024-05-23 18:20:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:20:09] [INFO ] Invariant cache hit.
[2024-05-23 18:20:10] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:20:17] [INFO ] Implicit Places using invariants and state equation in 7333 ms returned []
Implicit Place search using SMT with State Equation took 8929 ms to find 0 implicit places.
[2024-05-23 18:20:17] [INFO ] Redundant transitions in 568 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:20:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:20:17] [INFO ] Invariant cache hit.
[2024-05-23 18:20:17] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34339ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34399ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44084 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 400000 steps (8 resets) in 6255 ms. (63 steps per ms) remains 14/14 properties
Running SMT prover for 14 properties.
[2024-05-23 18:20:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:20:54] [INFO ] Invariant cache hit.
[2024-05-23 18:20:54] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-23 18:20:54] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2024-05-23 18:20:55] [INFO ] After 386ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14
[2024-05-23 18:20:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:20:55] [INFO ] After 194ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :14
TRAPS : Iteration 0
[2024-05-23 18:20:56] [INFO ] After 1244ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-23 18:20:56] [INFO ] After 1809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-23 18:20:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-23 18:20:56] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-23 18:20:56] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-23 18:20:57] [INFO ] After 265ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :14
TRAPS : Iteration 0
[2024-05-23 18:20:57] [INFO ] Deduced a trap composed of 3 places in 295 ms of which 3 ms to minimize.
[2024-05-23 18:20:57] [INFO ] Deduced a trap composed of 32 places in 340 ms of which 3 ms to minimize.
[2024-05-23 18:20:58] [INFO ] Deduced a trap composed of 3 places in 422 ms of which 4 ms to minimize.
[2024-05-23 18:20:58] [INFO ] Deduced a trap composed of 33 places in 340 ms of which 3 ms to minimize.
[2024-05-23 18:20:59] [INFO ] Deduced a trap composed of 35 places in 342 ms of which 3 ms to minimize.
[2024-05-23 18:20:59] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 3 ms to minimize.
[2024-05-23 18:20:59] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 3 ms to minimize.
[2024-05-23 18:21:00] [INFO ] Deduced a trap composed of 31 places in 323 ms of which 3 ms to minimize.
[2024-05-23 18:21:00] [INFO ] Deduced a trap composed of 12 places in 390 ms of which 3 ms to minimize.
[2024-05-23 18:21:00] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-23 18:21:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3775 ms
[2024-05-23 18:21:01] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 3 ms to minimize.
[2024-05-23 18:21:01] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
[2024-05-23 18:21:01] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 2 ms to minimize.
[2024-05-23 18:21:01] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 1 ms to minimize.
[2024-05-23 18:21:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 968 ms
[2024-05-23 18:21:02] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-05-23 18:21:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2024-05-23 18:21:02] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-23 18:21:02] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2024-05-23 18:21:02] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-23 18:21:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 452 ms
[2024-05-23 18:21:03] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2024-05-23 18:21:03] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2024-05-23 18:21:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2024-05-23 18:21:03] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2024-05-23 18:21:03] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-23 18:21:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 368 ms
TRAPS : Iteration 1
[2024-05-23 18:21:04] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-23 18:21:04] [INFO ] Deduced a trap composed of 15 places in 314 ms of which 3 ms to minimize.
[2024-05-23 18:21:04] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 2 ms to minimize.
[2024-05-23 18:21:05] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 2 ms to minimize.
[2024-05-23 18:21:05] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 2 ms to minimize.
[2024-05-23 18:21:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1223 ms
[2024-05-23 18:21:05] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 2 ms to minimize.
[2024-05-23 18:21:06] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-05-23 18:21:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 502 ms
[2024-05-23 18:21:06] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 2 ms to minimize.
[2024-05-23 18:21:06] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2024-05-23 18:21:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
TRAPS : Iteration 2
[2024-05-23 18:21:07] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-05-23 18:21:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2024-05-23 18:21:08] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 1 ms to minimize.
[2024-05-23 18:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
TRAPS : Iteration 3
[2024-05-23 18:21:09] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2024-05-23 18:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2024-05-23 18:21:09] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-23 18:21:10] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-23 18:21:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
TRAPS : Iteration 4
[2024-05-23 18:21:11] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-23 18:21:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-05-23 18:21:12] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2024-05-23 18:21:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
TRAPS : Iteration 5
[2024-05-23 18:21:13] [INFO ] After 16714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
[2024-05-23 18:21:13] [INFO ] After 17491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 279576 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 279576 steps, saw 189718 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2024-05-23 18:21:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:21:16] [INFO ] Invariant cache hit.
[2024-05-23 18:21:16] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 388/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 388/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:21:18] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 1 ms to minimize.
[2024-05-23 18:21:18] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 2/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1422 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2106ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 169 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 279598 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 279598 steps, saw 189734 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2024-05-23 18:21:22] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:21:22] [INFO ] Invariant cache hit.
[2024-05-23 18:21:22] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 388/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 388/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:21:24] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-05-23 18:21:24] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 2/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1946ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 171 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 169 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:21:24] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:21:24] [INFO ] Invariant cache hit.
[2024-05-23 18:21:26] [INFO ] Implicit Places using invariants in 1499 ms returned []
[2024-05-23 18:21:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:21:26] [INFO ] Invariant cache hit.
[2024-05-23 18:21:26] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:21:32] [INFO ] Implicit Places using invariants and state equation in 6480 ms returned []
Implicit Place search using SMT with State Equation took 7989 ms to find 0 implicit places.
[2024-05-23 18:21:33] [INFO ] Redundant transitions in 196 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:21:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:21:33] [INFO ] Invariant cache hit.
[2024-05-23 18:21:33] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34592ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34652ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43039 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 5 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
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 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 124 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-23 18:22:07] [INFO ] Computed 21 invariants in 2 ms
[2024-05-23 18:22:07] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:22:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-23 18:22:07] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:22:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 18:22:07] [INFO ] After 10ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:22:08] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:22:08] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 309 ms.
RANDOM walk for 40000 steps (8 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 279950 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 279950 steps, saw 189994 distinct states, run finished after 3005 ms. (steps per millisecond=93 ) properties seen :0
[2024-05-23 18:22:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:22:11] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 18:22:11] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:22:13] [INFO ] Deduced a trap composed of 110 places in 791 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2409ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 300 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 262273 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 262273 steps, saw 178398 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-23 18:22:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:22:17] [INFO ] Invariant cache hit.
[2024-05-23 18:22:17] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:22:19] [INFO ] Deduced a trap composed of 19 places in 867 ms of which 6 ms to minimize.
[2024-05-23 18:22:19] [INFO ] Deduced a trap composed of 90 places in 752 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:22:20] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 2 ms to minimize.
[2024-05-23 18:22:20] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 2/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1062 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2920 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 3607ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 184 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 228 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 278 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:22:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:22:21] [INFO ] Invariant cache hit.
[2024-05-23 18:22:22] [INFO ] Implicit Places using invariants in 1360 ms returned []
[2024-05-23 18:22:22] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:22:22] [INFO ] Invariant cache hit.
[2024-05-23 18:22:23] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:22:28] [INFO ] Implicit Places using invariants and state equation in 6040 ms returned []
Implicit Place search using SMT with State Equation took 7402 ms to find 0 implicit places.
[2024-05-23 18:22:29] [INFO ] Redundant transitions in 194 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:22:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:22:29] [INFO ] Invariant cache hit.
[2024-05-23 18:22:29] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34557ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34611ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42505 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 3 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
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 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 104 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-23 18:23:03] [INFO ] Computed 21 invariants in 2 ms
[2024-05-23 18:23:03] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:23:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-23 18:23:04] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:23:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 18:23:04] [INFO ] After 17ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:23:04] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:23:04] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 396 ms.
RANDOM walk for 40000 steps (8 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 217107 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 217107 steps, saw 149656 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-23 18:23:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:23:07] [INFO ] Computed 31 invariants in 7 ms
[2024-05-23 18:23:07] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:23:08] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:23:09] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2354ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 291 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 281886 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 281886 steps, saw 191253 distinct states, run finished after 3004 ms. (steps per millisecond=93 ) properties seen :0
[2024-05-23 18:23:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:23:13] [INFO ] Invariant cache hit.
[2024-05-23 18:23:13] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:23:14] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:23:14] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:23:15] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1824 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2722ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 188 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 286 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 277 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:23:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:23:16] [INFO ] Invariant cache hit.
[2024-05-23 18:23:18] [INFO ] Implicit Places using invariants in 1808 ms returned []
[2024-05-23 18:23:18] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:23:18] [INFO ] Invariant cache hit.
[2024-05-23 18:23:19] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:23:25] [INFO ] Implicit Places using invariants and state equation in 7303 ms returned []
Implicit Place search using SMT with State Equation took 9118 ms to find 0 implicit places.
[2024-05-23 18:23:26] [INFO ] Redundant transitions in 299 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:23:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:23:26] [INFO ] Invariant cache hit.
[2024-05-23 18:23:26] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34674ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34757ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44480 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 2 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
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 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 81 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-23 18:24:00] [INFO ] Computed 21 invariants in 3 ms
[2024-05-23 18:24:01] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:24:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-23 18:24:01] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:24:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 18:24:01] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:24:01] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:24:01] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 378 ms.
RANDOM walk for 40000 steps (8 resets) in 310 ms. (128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 240647 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 240647 steps, saw 165518 distinct states, run finished after 3004 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-23 18:24:04] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:24:04] [INFO ] Computed 31 invariants in 4 ms
[2024-05-23 18:24:04] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:24:05] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1473 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2330ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 129 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 274 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 308 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 265771 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 265771 steps, saw 180738 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-23 18:24:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:24:10] [INFO ] Invariant cache hit.
[2024-05-23 18:24:10] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:24:11] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1473 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2282ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 190 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 311 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 272 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:24:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:24:13] [INFO ] Invariant cache hit.
[2024-05-23 18:24:14] [INFO ] Implicit Places using invariants in 1614 ms returned []
[2024-05-23 18:24:14] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:24:14] [INFO ] Invariant cache hit.
[2024-05-23 18:24:15] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:24:22] [INFO ] Implicit Places using invariants and state equation in 7390 ms returned []
Implicit Place search using SMT with State Equation took 9006 ms to find 0 implicit places.
[2024-05-23 18:24:22] [INFO ] Redundant transitions in 186 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:24:22] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:24:22] [INFO ] Invariant cache hit.
[2024-05-23 18:24:22] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34764ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34822ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44307 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
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 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 69 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-23 18:24:57] [INFO ] Computed 21 invariants in 3 ms
[2024-05-23 18:24:57] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:24:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-23 18:24:57] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:24:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 18:24:57] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:24:57] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:24:57] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 360 ms.
RANDOM walk for 40000 steps (8 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 271612 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 271612 steps, saw 184464 distinct states, run finished after 3004 ms. (steps per millisecond=90 ) properties seen :0
[2024-05-23 18:25:00] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:25:00] [INFO ] Computed 31 invariants in 11 ms
[2024-05-23 18:25:00] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:25:02] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1533 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 177 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 315 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 462 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 249667 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 249667 steps, saw 171233 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
[2024-05-23 18:25:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:25:07] [INFO ] Invariant cache hit.
[2024-05-23 18:25:07] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 933 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:25:08] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:25:09] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1696 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2686ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 168 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 271 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 269 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:25:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:25:10] [INFO ] Invariant cache hit.
[2024-05-23 18:25:12] [INFO ] Implicit Places using invariants in 1626 ms returned []
[2024-05-23 18:25:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:25:12] [INFO ] Invariant cache hit.
[2024-05-23 18:25:12] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:25:18] [INFO ] Implicit Places using invariants and state equation in 6865 ms returned []
Implicit Place search using SMT with State Equation took 8494 ms to find 0 implicit places.
[2024-05-23 18:25:19] [INFO ] Redundant transitions in 185 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:25:19] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:25:19] [INFO ] Invariant cache hit.
[2024-05-23 18:25:19] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34358ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43373 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 58 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-23 18:25:53] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 18:25:53] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:25:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-23 18:25:53] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:25:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 18:25:53] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:25:53] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 18:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2024-05-23 18:25:53] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:25:53] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 394 ms.
RANDOM walk for 40000 steps (8 resets) in 375 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 255200 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 255200 steps, saw 174435 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2024-05-23 18:25:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:25:57] [INFO ] Computed 31 invariants in 5 ms
[2024-05-23 18:25:57] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:25:59] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 1/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2247ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 267 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 656 ms. (60 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 242264 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 242264 steps, saw 166617 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-23 18:26:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:26:02] [INFO ] Invariant cache hit.
[2024-05-23 18:26:02] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:26:05] [INFO ] Deduced a trap composed of 102 places in 1144 ms of which 9 ms to minimize.
[2024-05-23 18:26:05] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2545 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3255ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 117 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 259 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 252 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:26:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:26:06] [INFO ] Invariant cache hit.
[2024-05-23 18:26:08] [INFO ] Implicit Places using invariants in 1707 ms returned []
[2024-05-23 18:26:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:26:08] [INFO ] Invariant cache hit.
[2024-05-23 18:26:09] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:26:15] [INFO ] Implicit Places using invariants and state equation in 6790 ms returned []
Implicit Place search using SMT with State Equation took 8505 ms to find 0 implicit places.
[2024-05-23 18:26:15] [INFO ] Redundant transitions in 285 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:26:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:26:15] [INFO ] Invariant cache hit.
[2024-05-23 18:26:15] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34736ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34814ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43887 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
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 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 42 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-23 18:26:50] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 18:26:50] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:26:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-23 18:26:50] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:26:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 18:26:50] [INFO ] After 10ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:26:50] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:26:50] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 228 ms.
RANDOM walk for 40000 steps (8 resets) in 650 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 253440 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 253440 steps, saw 173409 distinct states, run finished after 3004 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-23 18:26:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:26:53] [INFO ] Computed 31 invariants in 4 ms
[2024-05-23 18:26:53] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:26:55] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-23 18:26:55] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:26:55] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1905ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 284768 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 284768 steps, saw 192764 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-23 18:26:59] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:26:59] [INFO ] Invariant cache hit.
[2024-05-23 18:26:59] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:27:00] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 1/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1717ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 172 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 166 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:27:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:27:01] [INFO ] Invariant cache hit.
[2024-05-23 18:27:02] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2024-05-23 18:27:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:27:02] [INFO ] Invariant cache hit.
[2024-05-23 18:27:02] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:27:07] [INFO ] Implicit Places using invariants and state equation in 5192 ms returned []
Implicit Place search using SMT with State Equation took 6348 ms to find 0 implicit places.
[2024-05-23 18:27:07] [INFO ] Redundant transitions in 193 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:27:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:27:07] [INFO ] Invariant cache hit.
[2024-05-23 18:27:07] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34239ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41014 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
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 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 49 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-23 18:27:42] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 18:27:42] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:27:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-23 18:27:42] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:27:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 18:27:42] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:27:42] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:27:42] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 248 ms.
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 286132 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 286132 steps, saw 193598 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-05-23 18:27:45] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:27:45] [INFO ] Computed 31 invariants in 3 ms
[2024-05-23 18:27:45] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:27:47] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2024-05-23 18:27:47] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 2/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1524 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2202ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 190 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 343 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 285857 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 285857 steps, saw 193479 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-05-23 18:27:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:27:51] [INFO ] Invariant cache hit.
[2024-05-23 18:27:51] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:27:52] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:27:52] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1238 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1902ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 105 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 164 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 163 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:27:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:27:53] [INFO ] Invariant cache hit.
[2024-05-23 18:27:54] [INFO ] Implicit Places using invariants in 1274 ms returned []
[2024-05-23 18:27:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:27:54] [INFO ] Invariant cache hit.
[2024-05-23 18:27:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:28:00] [INFO ] Implicit Places using invariants and state equation in 5195 ms returned []
Implicit Place search using SMT with State Equation took 6471 ms to find 0 implicit places.
[2024-05-23 18:28:00] [INFO ] Redundant transitions in 189 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:28:00] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:28:00] [INFO ] Invariant cache hit.
[2024-05-23 18:28:00] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34443ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41334 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
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 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 49 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-23 18:28:34] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 18:28:34] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:28:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-23 18:28:34] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:28:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 18:28:34] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:28:35] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:28:35] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 262 ms.
RANDOM walk for 40000 steps (8 resets) in 628 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 278718 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 278718 steps, saw 189180 distinct states, run finished after 3005 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-23 18:28:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:28:38] [INFO ] Computed 31 invariants in 3 ms
[2024-05-23 18:28:38] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:28:40] [INFO ] Deduced a trap composed of 25 places in 828 ms of which 6 ms to minimize.
[2024-05-23 18:28:40] [INFO ] Deduced a trap composed of 114 places in 898 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2584 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3262ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 277497 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 277497 steps, saw 188437 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-23 18:28:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:28:44] [INFO ] Invariant cache hit.
[2024-05-23 18:28:44] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:28:47] [INFO ] Deduced a trap composed of 27 places in 976 ms of which 6 ms to minimize.
[2024-05-23 18:28:47] [INFO ] Deduced a trap composed of 103 places in 850 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3869ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 270 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 263 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-23 18:28:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:28:49] [INFO ] Invariant cache hit.
[2024-05-23 18:28:51] [INFO ] Implicit Places using invariants in 1732 ms returned []
[2024-05-23 18:28:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:28:51] [INFO ] Invariant cache hit.
[2024-05-23 18:28:51] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:28:57] [INFO ] Implicit Places using invariants and state equation in 6339 ms returned []
Implicit Place search using SMT with State Equation took 8085 ms to find 0 implicit places.
[2024-05-23 18:28:57] [INFO ] Redundant transitions in 190 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-05-23 18:28:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-23 18:28:57] [INFO ] Invariant cache hit.
[2024-05-23 18:28:57] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34708ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34772ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43334 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
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 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 52 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-23 18:29:32] [INFO ] Computed 21 invariants in 2 ms
[2024-05-23 18:29:32] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:29:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-23 18:29:32] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:29:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 18:29:32] [INFO ] After 15ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:29:32] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:29:32] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 316 ms.
RANDOM walk for 40000 steps (8 resets) in 711 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 266849 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 266849 steps, saw 181506 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-23 18:29:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:29:35] [INFO ] Computed 31 invariants in 6 ms
[2024-05-23 18:29:35] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:29:37] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 2 ms to minimize.
[2024-05-23 18:29:37] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2552ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 268 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-smll-171636275100128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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