MCC'2024- Execution of r167-smll-171636275100118

About the Execution of ITS-Tools for EisenbergMcGuire-PT-08

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
8860.960	1800000.00	3139998.00	3830.80	[undef]	Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r167-smll-171636275100118.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-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-smll-171636275100118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 1.7M 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 1716481669957

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-23 16:27:53] [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 16:27:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:27:54] [INFO ] Load time of PNML (sax parser for PT used): 736 ms
[2024-05-23 16:27:54] [INFO ] Transformed 712 places.
[2024-05-23 16:27:54] [INFO ] Transformed 2816 transitions.
[2024-05-23 16:27:54] [INFO ] Found NUPN structural information;
[2024-05-23 16:27:54] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 1157 ms.
RANDOM walk for 40000 steps (8 resets) in 6090 ms. (6 steps per ms) remains 227/712 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 30 ms. (13 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 39 ms. (10 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 31 ms. (12 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 42 ms. (9 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 66 ms. (6 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 34 ms. (11 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 49 ms. (8 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 33 ms. (11 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 227/227 properties
[2024-05-23 16:27:57] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
[2024-05-23 16:27:58] [INFO ] Flatten gal took : 870 ms
// Phase 1: matrix 1368 rows 712 cols
[2024-05-23 16:27:58] [INFO ] Computed 25 invariants in 61 ms
[2024-05-23 16:27:58] [INFO ] State equation strengthened by 676 read => feed constraints.
[2024-05-23 16:27:58] [INFO ] Flatten gal took : 416 ms
[2024-05-23 16:27:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3881408962439370454.gal : 166 ms
[2024-05-23 16:27:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9644615877856165117.prop : 3 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/ReachabilityCardinality3881408962439370454.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9644615877856165117.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 ...328
Loading property file /tmp/ReachabilityCardinality9644615877856165117.prop.
SDD proceeding with computation,227 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,227 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,227 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,227 properties remain. new max is 32
SDD size :11 after 15
SDD proceeding with computation,227 properties remain. new max is 64
SDD size :15 after 19
SDD proceeding with computation,227 properties remain. new max is 128
SDD size :19 after 21
SDD proceeding with computation,227 properties remain. new max is 256
SDD size :21 after 105
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 227 unsolved
SDD proceeding with computation,227 properties remain. new max is 512
SDD size :105 after 207
Invariant property smplace_512 does not hold.
Invariant property smplace_490 does not hold.
SDD proceeding with computation,225 properties remain. new max is 512
SDD size :207 after 310
SDD proceeding with computation,225 properties remain. new max is 1024
SDD size :310 after 1509
SDD proceeding with computation,225 properties remain. new max is 2048
SDD size :1509 after 1953
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 227/2080 variables, and 227 constraints, problems are : Problem set: 2 solved, 225 unsolved in 5281 ms.
Refiners :[Domain max(s): 227/712 constraints, Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/712 constraints, ReadFeed: 0/676 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 2 solved, 225 unsolved
Invariant property smplace_513 does not hold.
Invariant property smplace_488 does not hold.
SDD proceeding with computation,223 properties remain. new max is 2048
SDD size :1953 after 5068
Invariant property smplace_498 does not hold.
Invariant property smplace_496 does not hold.
SDD proceeding with computation,221 properties remain. new max is 2048
SDD size :5068 after 6671
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/2080 variables, and 225 constraints, problems are : Problem set: 6 solved, 221 unsolved in 5093 ms.
Refiners :[Domain max(s): 225/712 constraints, Positive P Invariants (semi-flows): 0/17 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/712 constraints, ReadFeed: 0/676 constraints, PredecessorRefiner: 0/227 constraints, Known Traps: 0/0 constraints]
After SMT, in 10963ms problems are : Problem set: 6 solved, 221 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 221 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 144 Pre rules applied. Total rules applied 16 place count 704 transition count 2664
Deduced a syphon composed of 144 places in 6 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 304 place count 560 transition count 2664
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 360 place count 504 transition count 2216
Iterating global reduction 2 with 56 rules applied. Total rules applied 416 place count 504 transition count 2216
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 22 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 520 place count 452 transition count 2164
Applied a total of 520 rules in 923 ms. Remains 452 /712 variables (removed 260) and now considering 2164/2816 (removed 652) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 956 ms. Remains : 452/712 places, 2164/2816 transitions.
SDD proceeding with computation,221 properties remain. new max is 4096
SDD size :6671 after 28012
SDD proceeding with computation,221 properties remain. new max is 8192
SDD size :28012 after 44851
Invariant property smplace_514 does not hold.
SDD proceeding with computation,220 properties remain. new max is 8192
SDD size :44851 after 62944
RANDOM walk for 2736076 steps (7 resets) in 120021 ms. (22 steps per ms) remains 211/221 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 209/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 423 ms. (94 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 208/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 206/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 206/206 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 206/206 properties
Invariant property smplace_506 does not hold.
Invariant property smplace_504 does not hold.
Invariant property smplace_489 does not hold.
SDD proceeding with computation,217 properties remain. new max is 8192
SDD size :62944 after 107090
Invariant property smplace_497 does not hold.
SDD proceeding with computation,216 properties remain. new max is 8192
SDD size :107090 after 146845
SDD proceeding with computation,216 properties remain. new max is 16384
SDD size :146845 after 170467
SDD proceeding with computation,216 properties remain. new max is 32768
SDD size :170467 after 796774
SDD proceeding with computation,216 properties remain. new max is 65536
SDD size :796774 after 1.28661e+06
Interrupted probabilistic random walk after 8138151 steps, run timeout after 120001 ms. (steps per millisecond=67 ) properties seen :198 out of 206
Probabilistic random walk after 8138151 steps, saw 1753629 distinct states, run finished after 120025 ms. (steps per millisecond=67 ) properties seen :198
[2024-05-23 16:30:51] [INFO ] Flow matrix only has 716 transitions (discarded 1448 similar events)
// Phase 1: matrix 716 rows 452 cols
[2024-05-23 16:30:51] [INFO ] Computed 25 invariants in 24 ms
[2024-05-23 16:30:51] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 261/268 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 10/278 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 448/726 variables, 278/293 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 70/363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 50/776 variables, 8/371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/776 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/776 variables, 48/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/776 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 66/842 variables, 30/450 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/842 variables, 24/474 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 130/972 variables, 6/480 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/972 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 6/978 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/978 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 190/1168 variables, 136/619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1168 variables, 142/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1168 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 0/1168 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1168/1168 variables, and 761 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4924 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 452/452 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 261/268 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 10/278 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:30:57] [INFO ] Deduced a trap composed of 3 places in 639 ms of which 65 ms to minimize.
Invariant property smplace_255 does not hold.
SDD proceeding with computation,215 properties remain. new max is 65536
SDD size :1.28661e+06 after 2.18214e+06
[2024-05-23 16:30:59] [INFO ] Deduced a trap composed of 3 places in 2557 ms of which 4 ms to minimize.
[2024-05-23 16:31:00] [INFO ] Deduced a trap composed of 3 places in 702 ms of which 3 ms to minimize.
[2024-05-23 16:31:01] [INFO ] Deduced a trap composed of 44 places in 351 ms of which 2 ms to minimize.
[2024-05-23 16:31:01] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:31:04] [INFO ] Deduced a trap composed of 17 places in 3245 ms of which 4 ms to minimize.
[2024-05-23 16:31:04] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 2 ms to minimize.
[2024-05-23 16:31:05] [INFO ] Deduced a trap composed of 13 places in 756 ms of which 2 ms to minimize.
[2024-05-23 16:31:05] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 2 ms to minimize.
[2024-05-23 16:31:06] [INFO ] Deduced a trap composed of 39 places in 1031 ms of which 11 ms to minimize.
[2024-05-23 16:31:07] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2024-05-23 16:31:08] [INFO ] Deduced a trap composed of 43 places in 1792 ms of which 32 ms to minimize.
[2024-05-23 16:31:10] [INFO ] Deduced a trap composed of 17 places in 1982 ms of which 2 ms to minimize.
[2024-05-23 16:31:11] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 32 ms to minimize.
[2024-05-23 16:31:11] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:31:14] [INFO ] Deduced a trap composed of 27 places in 2550 ms of which 32 ms to minimize.
[2024-05-23 16:31:14] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 2 ms to minimize.
[2024-05-23 16:31:14] [INFO ] Deduced a trap composed of 15 places in 585 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:31:17] [INFO ] Deduced a trap composed of 19 places in 2013 ms of which 29 ms to minimize.
[2024-05-23 16:31:17] [INFO ] Deduced a trap composed of 46 places in 320 ms of which 1 ms to minimize.
[2024-05-23 16:31:18] [INFO ] Deduced a trap composed of 45 places in 1343 ms of which 45 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 448/726 variables, 278/314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 70/384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/726 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 50/776 variables, 8/392 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/776 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/776 variables, 48/441 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/776 variables, 5/446 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/776 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 66/842 variables, 30/476 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/842 variables, 24/500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/842 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 130/972 variables, 6/506 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/972 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 6/978 variables, 3/509 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/978 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:31:23] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 3 ms to minimize.
[2024-05-23 16:31:23] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 2 ms to minimize.
[2024-05-23 16:31:25] [INFO ] Deduced a trap composed of 70 places in 1320 ms of which 16 ms to minimize.
[2024-05-23 16:31:25] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/978 variables, 4/515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:31:26] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/978 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:31:27] [INFO ] Deduced a trap composed of 82 places in 703 ms of which 50 ms to minimize.
[2024-05-23 16:31:28] [INFO ] Deduced a trap composed of 80 places in 757 ms of which 4 ms to minimize.
[2024-05-23 16:31:29] [INFO ] Deduced a trap composed of 74 places in 719 ms of which 14 ms to minimize.
[2024-05-23 16:31:29] [INFO ] Deduced a trap composed of 70 places in 679 ms of which 13 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/978 variables, 4/520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/978 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 190/1168 variables, 136/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1168 variables, 142/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1168 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (OVERLAPS) 0/1168 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1168/1168 variables, and 798 constraints, problems are : Problem set: 0 solved, 7 unsolved in 37015 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 452/452 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 30/30 constraints]
After SMT, in 42073ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 2456 ms.
Support contains 6 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 2164/2164 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 452 transition count 2108
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 396 transition count 2108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 392 transition count 2104
Applied a total of 120 rules in 316 ms. Remains 392 /452 variables (removed 60) and now considering 2104/2164 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 392/452 places, 2104/2164 transitions.
RANDOM walk for 4000000 steps (8 resets) in 37467 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7251 ms. (551 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7897 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 6615 ms. (604 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 6319 ms. (632 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 5480 ms. (729 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 5625 ms. (710 steps per ms) remains 6/6 properties
SDD proceeding with computation,215 properties remain. new max is 131072
SDD size :2.18214e+06 after 3.00775e+06
Interrupted probabilistic random walk after 4555161 steps, run timeout after 63001 ms. (steps per millisecond=72 ) properties seen :0 out of 6
Probabilistic random walk after 4555161 steps, saw 1285042 distinct states, run finished after 63001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-23 16:33:00] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-23 16:33:00] [INFO ] Computed 25 invariants in 5 ms
[2024-05-23 16:33:00] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/240 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 410/650 variables, 240/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 70/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 50/700 variables, 8/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 48/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 66/766 variables, 30/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/766 variables, 24/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/766 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 107/873 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/875 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/875 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 5/880 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/880 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 168/1048 variables, 114/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 142/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/240 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:33:02] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 3 ms to minimize.
[2024-05-23 16:33:02] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 3 ms to minimize.
[2024-05-23 16:33:02] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 2 ms to minimize.
[2024-05-23 16:33:03] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2024-05-23 16:33:03] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:33:03] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:33:03] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2024-05-23 16:33:03] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2024-05-23 16:33:03] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:33:03] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:33:03] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:33:04] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
[2024-05-23 16:33:04] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 2 ms to minimize.
[2024-05-23 16:33:04] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-05-23 16:33:04] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 3 ms to minimize.
[2024-05-23 16:33:04] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 2 ms to minimize.
[2024-05-23 16:33:04] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:33:04] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:33:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:33:05] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:33:05] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:33:05] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:33:05] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 410/650 variables, 240/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 70/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 50/700 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/700 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 48/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/700 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/700 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 66/766 variables, 30/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/766 variables, 24/464 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/766 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 107/873 variables, 5/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:33:09] [INFO ] Deduced a trap composed of 69 places in 3319 ms of which 3 ms to minimize.
[2024-05-23 16:33:09] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/873 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/873 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2/875 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/875 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 5/880 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/880 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/880 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 168/1048 variables, 114/590 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1048 variables, 142/732 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1048 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 0/1048 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 732 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9152 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 25/25 constraints]
After SMT, in 10531ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2795 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 96 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 94 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-23 16:33:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:33:14] [INFO ] Invariant cache hit.
[2024-05-23 16:33:14] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-05-23 16:33:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:33:14] [INFO ] Invariant cache hit.
[2024-05-23 16:33:15] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:33:17] [INFO ] Implicit Places using invariants and state equation in 2737 ms returned []
Implicit Place search using SMT with State Equation took 3445 ms to find 0 implicit places.
[2024-05-23 16:33:17] [INFO ] Redundant transitions in 159 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-23 16:33:17] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:33:17] [INFO ] Invariant cache hit.
[2024-05-23 16:33:17] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:33:41] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 4 ms to minimize.
[2024-05-23 16:33:41] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 17 ms to minimize.
[2024-05-23 16:33:42] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 3 ms to minimize.
[2024-05-23 16:33:42] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2024-05-23 16:33:42] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:33:42] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2024-05-23 16:33:42] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:33:42] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-05-23 16:33:43] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 4 ms to minimize.
[2024-05-23 16:33:43] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 4 ms to minimize.
[2024-05-23 16:33:43] [INFO ] Deduced a trap composed of 70 places in 232 ms of which 3 ms to minimize.
[2024-05-23 16:33:43] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 3 ms to minimize.
[2024-05-23 16:33:43] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:33:44] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:33:45] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
[2024-05-23 16:33:46] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:33:46] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 3 ms to minimize.
[2024-05-23 16:33:46] [INFO ] Deduced a trap composed of 58 places in 255 ms of which 3 ms to minimize.
[2024-05-23 16:33:47] [INFO ] Deduced a trap composed of 62 places in 240 ms of which 3 ms to minimize.
[2024-05-23 16:33:47] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:33:48] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:33:48] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:33:48] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
[2024-05-23 16:33:48] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 2 ms to minimize.
[2024-05-23 16:33:49] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:33:49] [INFO ] Deduced a trap composed of 75 places in 333 ms of which 4 ms to minimize.
[2024-05-23 16:33:49] [INFO ] Deduced a trap composed of 70 places in 300 ms of which 4 ms to minimize.
SMT process timed out in 31971ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 32012ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35746 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 400000 steps (8 resets) in 6620 ms. (60 steps per ms) remains 6/6 properties
Running SMT prover for 6 properties.
[2024-05-23 16:33:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:33:51] [INFO ] Invariant cache hit.
[2024-05-23 16:33:52] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2024-05-23 16:33:52] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-23 16:33:52] [INFO ] After 293ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2024-05-23 16:33:52] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:33:52] [INFO ] After 81ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 16:33:52] [INFO ] After 381ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 16:33:52] [INFO ] After 899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 16:33:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-23 16:33:52] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-23 16:33:53] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 16:33:53] [INFO ] After 103ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 16:33:53] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 3 ms to minimize.
[2024-05-23 16:33:53] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 2 ms to minimize.
[2024-05-23 16:33:54] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 2 ms to minimize.
[2024-05-23 16:33:54] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:33:54] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:33:54] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
[2024-05-23 16:33:54] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:33:54] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:33:54] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:33:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1632 ms
[2024-05-23 16:33:55] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:33:55] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 14 ms to minimize.
[2024-05-23 16:33:55] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 1 ms to minimize.
[2024-05-23 16:33:55] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:33:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 741 ms
TRAPS : Iteration 1
[2024-05-23 16:33:56] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 3 ms to minimize.
[2024-05-23 16:33:56] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-05-23 16:33:56] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:33:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 418 ms
TRAPS : Iteration 2
[2024-05-23 16:33:57] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
TRAPS : Iteration 3
[2024-05-23 16:33:57] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:33:57] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:33:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
TRAPS : Iteration 4
[2024-05-23 16:33:58] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
TRAPS : Iteration 5
[2024-05-23 16:33:58] [INFO ] After 5325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-23 16:33:58] [INFO ] After 5762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
RANDOM walk for 4000000 steps (8 resets) in 19680 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4407 ms. (907 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4376 ms. (913 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4608 ms. (867 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3919 ms. (1020 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4117 ms. (971 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3670 ms. (1089 steps per ms) remains 6/6 properties
Invariant property smplace_523 does not hold.
Invariant property smplace_522 does not hold.
Invariant property smplace_521 does not hold.
Invariant property smplace_520 does not hold.
SDD proceeding with computation,211 properties remain. new max is 131072
SDD size :3.00775e+06 after 5.47374e+06
Interrupted probabilistic random walk after 2468646 steps, run timeout after 39001 ms. (steps per millisecond=63 ) properties seen :0 out of 6
Probabilistic random walk after 2468646 steps, saw 847897 distinct states, run finished after 39006 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-23 16:34:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:34:50] [INFO ] Invariant cache hit.
[2024-05-23 16:34:50] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/240 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 410/650 variables, 240/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 70/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 50/700 variables, 8/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 48/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 66/766 variables, 30/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/766 variables, 24/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/766 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 107/873 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/875 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/875 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 5/880 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/880 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 168/1048 variables, 114/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 142/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6535 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/240 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:34:58] [INFO ] Deduced a trap composed of 5 places in 386 ms of which 3 ms to minimize.
[2024-05-23 16:34:58] [INFO ] Deduced a trap composed of 17 places in 356 ms of which 3 ms to minimize.
[2024-05-23 16:34:58] [INFO ] Deduced a trap composed of 25 places in 499 ms of which 2 ms to minimize.
[2024-05-23 16:34:59] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 2 ms to minimize.
[2024-05-23 16:34:59] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 2 ms to minimize.
[2024-05-23 16:34:59] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 2 ms to minimize.
[2024-05-23 16:34:59] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-05-23 16:34:59] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 2 ms to minimize.
[2024-05-23 16:35:00] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 1 ms to minimize.
[2024-05-23 16:35:00] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 2 ms to minimize.
[2024-05-23 16:35:00] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 1 ms to minimize.
[2024-05-23 16:35:04] [INFO ] Deduced a trap composed of 19 places in 3886 ms of which 24 ms to minimize.
[2024-05-23 16:35:05] [INFO ] Deduced a trap composed of 41 places in 1557 ms of which 31 ms to minimize.
[2024-05-23 16:35:07] [INFO ] Deduced a trap composed of 43 places in 1622 ms of which 34 ms to minimize.
[2024-05-23 16:35:07] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 2 ms to minimize.
[2024-05-23 16:35:08] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 2 ms to minimize.
[2024-05-23 16:35:08] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 1 ms to minimize.
[2024-05-23 16:35:08] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2024-05-23 16:35:08] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:35:09] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:35:10] [INFO ] Deduced a trap composed of 11 places in 1384 ms of which 2 ms to minimize.
[2024-05-23 16:35:11] [INFO ] Deduced a trap composed of 3 places in 589 ms of which 32 ms to minimize.
[2024-05-23 16:35:11] [INFO ] Deduced a trap composed of 11 places in 299 ms of which 2 ms to minimize.
[2024-05-23 16:35:11] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 410/650 variables, 240/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 70/349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 50/700 variables, 8/357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/700 variables, 48/406 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/700 variables, 5/411 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 66/766 variables, 30/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/766 variables, 24/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/766 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 107/873 variables, 5/470 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/875 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:35:14] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2024-05-23 16:35:14] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 2 ms to minimize.
[2024-05-23 16:35:15] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:35:17] [INFO ] Deduced a trap composed of 15 places in 2220 ms of which 6 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/875 variables, 4/475 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/875 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 5/880 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/880 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:35:18] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 1 ms to minimize.
[2024-05-23 16:35:21] [INFO ] Deduced a trap composed of 58 places in 2300 ms of which 2 ms to minimize.
[2024-05-23 16:35:21] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2024-05-23 16:35:22] [INFO ] Deduced a trap composed of 29 places in 675 ms of which 32 ms to minimize.
[2024-05-23 16:35:22] [INFO ] Deduced a trap composed of 70 places in 498 ms of which 12 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/880 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:35:24] [INFO ] Deduced a trap composed of 72 places in 843 ms of which 36 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/880 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:35:25] [INFO ] Deduced a trap composed of 67 places in 767 ms of which 46 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/880 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/880 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 168/1048 variables, 114/600 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1048 variables, 142/742 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1048 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 0/1048 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 742 constraints, problems are : Problem set: 0 solved, 6 unsolved in 29424 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 35/35 constraints]
After SMT, in 36030ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2579 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 110 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 75 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-23 16:35:29] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:35:29] [INFO ] Invariant cache hit.
[2024-05-23 16:35:30] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2024-05-23 16:35:30] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:35:30] [INFO ] Invariant cache hit.
[2024-05-23 16:35:31] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:35:35] [INFO ] Implicit Places using invariants and state equation in 4385 ms returned []
Implicit Place search using SMT with State Equation took 5398 ms to find 0 implicit places.
[2024-05-23 16:35:35] [INFO ] Redundant transitions in 141 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-23 16:35:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:35:35] [INFO ] Invariant cache hit.
[2024-05-23 16:35:35] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 31661ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31691ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37342 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 400000 steps (8 resets) in 3449 ms. (115 steps per ms) remains 6/6 properties
Running SMT prover for 6 properties.
[2024-05-23 16:36:07] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:36:07] [INFO ] Invariant cache hit.
[2024-05-23 16:36:08] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-23 16:36:08] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 17 ms returned sat
[2024-05-23 16:36:08] [INFO ] After 647ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2024-05-23 16:36:08] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:36:09] [INFO ] After 277ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 16:36:09] [INFO ] After 830ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 16:36:09] [INFO ] After 1754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 16:36:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-05-23 16:36:09] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 11 ms returned sat
[2024-05-23 16:36:10] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 16:36:10] [INFO ] After 177ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 16:36:11] [INFO ] Deduced a trap composed of 3 places in 331 ms of which 2 ms to minimize.
[2024-05-23 16:36:11] [INFO ] Deduced a trap composed of 52 places in 398 ms of which 4 ms to minimize.
[2024-05-23 16:36:12] [INFO ] Deduced a trap composed of 5 places in 456 ms of which 2 ms to minimize.
[2024-05-23 16:36:12] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 2 ms to minimize.
[2024-05-23 16:36:12] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 2 ms to minimize.
[2024-05-23 16:36:13] [INFO ] Deduced a trap composed of 19 places in 480 ms of which 3 ms to minimize.
[2024-05-23 16:36:13] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 2 ms to minimize.
[2024-05-23 16:36:15] [INFO ] Deduced a trap composed of 17 places in 2256 ms of which 17 ms to minimize.
[2024-05-23 16:36:16] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 1 ms to minimize.
[2024-05-23 16:36:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5347 ms
[2024-05-23 16:36:18] [INFO ] Deduced a trap composed of 19 places in 1980 ms of which 1 ms to minimize.
[2024-05-23 16:36:19] [INFO ] Deduced a trap composed of 3 places in 972 ms of which 1 ms to minimize.
[2024-05-23 16:36:19] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:36:19] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:36:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3322 ms
TRAPS : Iteration 1
[2024-05-23 16:36:20] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 2 ms to minimize.
[2024-05-23 16:36:20] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:36:20] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:36:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
TRAPS : Iteration 2
[2024-05-23 16:36:21] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2024-05-23 16:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
TRAPS : Iteration 3
[2024-05-23 16:36:21] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:36:21] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:36:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
TRAPS : Iteration 4
[2024-05-23 16:36:22] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 2 ms to minimize.
[2024-05-23 16:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
TRAPS : Iteration 5
[2024-05-23 16:36:22] [INFO ] After 12146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-23 16:36:22] [INFO ] After 13060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 384579 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 384579 steps, saw 211679 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2024-05-23 16:36:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:36:25] [INFO ] Invariant cache hit.
[2024-05-23 16:36:25] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 28/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 246/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 28/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:36:26] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:36:26] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 246/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:36:27] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1429ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 77 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 375732 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 375732 steps, saw 207266 distinct states, run finished after 3013 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-23 16:36:30] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:36:30] [INFO ] Invariant cache hit.
[2024-05-23 16:36:30] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 28/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 246/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 28/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:36:31] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:36:31] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 246/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:36:31] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 919 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1445ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 70 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 72 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-23 16:36:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:36:32] [INFO ] Invariant cache hit.
[2024-05-23 16:36:32] [INFO ] Implicit Places using invariants in 720 ms returned []
[2024-05-23 16:36:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:36:32] [INFO ] Invariant cache hit.
[2024-05-23 16:36:33] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:36:35] [INFO ] Implicit Places using invariants and state equation in 2771 ms returned []
Implicit Place search using SMT with State Equation took 3498 ms to find 0 implicit places.
[2024-05-23 16:36:35] [INFO ] Redundant transitions in 57 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-23 16:36:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:36:35] [INFO ] Invariant cache hit.
[2024-05-23 16:36:35] [INFO ] State equation strengthened by 284 read => feed constraints.
SDD proceeding with computation,211 properties remain. new max is 262144
SDD size :5.47374e+06 after 1.86294e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:37:00] [INFO ] Deduced a trap composed of 4 places in 590 ms of which 7 ms to minimize.
[2024-05-23 16:37:00] [INFO ] Deduced a trap composed of 3 places in 714 ms of which 43 ms to minimize.
[2024-05-23 16:37:01] [INFO ] Deduced a trap composed of 3 places in 395 ms of which 2 ms to minimize.
[2024-05-23 16:37:01] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 3 ms to minimize.
[2024-05-23 16:37:01] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 2 ms to minimize.
[2024-05-23 16:37:02] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 2 ms to minimize.
[2024-05-23 16:37:02] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 2 ms to minimize.
[2024-05-23 16:37:02] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 2 ms to minimize.
[2024-05-23 16:37:02] [INFO ] Deduced a trap composed of 58 places in 439 ms of which 7 ms to minimize.
[2024-05-23 16:37:03] [INFO ] Deduced a trap composed of 58 places in 411 ms of which 19 ms to minimize.
[2024-05-23 16:37:03] [INFO ] Deduced a trap composed of 70 places in 409 ms of which 6 ms to minimize.
[2024-05-23 16:37:04] [INFO ] Deduced a trap composed of 58 places in 349 ms of which 5 ms to minimize.
[2024-05-23 16:37:04] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 1 ms to minimize.
[2024-05-23 16:37:04] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-05-23 16:37:05] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 3 ms to minimize.
[2024-05-23 16:37:06] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:37:06] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 2 ms to minimize.
[2024-05-23 16:37:06] [INFO ] Deduced a trap composed of 58 places in 244 ms of which 3 ms to minimize.
[2024-05-23 16:37:07] [INFO ] Deduced a trap composed of 62 places in 240 ms of which 3 ms to minimize.
[2024-05-23 16:37:07] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 3 ms to minimize.
SMT process timed out in 31600ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31628ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35273 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 6 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 98 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2024-05-23 16:37:07] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 16:37:07] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:37:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:07] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:37:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 16:37:07] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:37:07] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:37:07] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 258 ms.
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 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 380745 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 380745 steps, saw 209691 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2024-05-23 16:37:10] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-23 16:37:10] [INFO ] Computed 25 invariants in 8 ms
[2024-05-23 16:37:10] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:37:11] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2024-05-23 16:37:11] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-05-23 16:37:11] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:37:12] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:37:12] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:37:12] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 2/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 708 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1972ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 113 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 392/392 places, 2104/2104 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 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 370647 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 370647 steps, saw 204891 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-23 16:37:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:37:16] [INFO ] Invariant cache hit.
[2024-05-23 16:37:16] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:37:16] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:37:17] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:37:17] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1199 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1697ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 167 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 108 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-23 16:37:18] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:37:18] [INFO ] Invariant cache hit.
[2024-05-23 16:37:19] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2024-05-23 16:37:19] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:37:19] [INFO ] Invariant cache hit.
[2024-05-23 16:37:19] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:37:21] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned []
Implicit Place search using SMT with State Equation took 3904 ms to find 0 implicit places.
[2024-05-23 16:37:22] [INFO ] Redundant transitions in 61 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-23 16:37:22] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:37:22] [INFO ] Invariant cache hit.
[2024-05-23 16:37:22] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:37:45] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 4 ms to minimize.
[2024-05-23 16:37:45] [INFO ] Deduced a trap composed of 3 places in 364 ms of which 4 ms to minimize.
[2024-05-23 16:37:45] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 2 ms to minimize.
[2024-05-23 16:37:46] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 3 ms to minimize.
[2024-05-23 16:37:46] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 2 ms to minimize.
[2024-05-23 16:37:46] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:37:46] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:37:46] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:37:47] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 3 ms to minimize.
[2024-05-23 16:37:47] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 4 ms to minimize.
[2024-05-23 16:37:47] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 3 ms to minimize.
[2024-05-23 16:37:47] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 3 ms to minimize.
[2024-05-23 16:37:47] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:37:47] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-23 16:37:49] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 3 ms to minimize.
[2024-05-23 16:37:49] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 4 ms to minimize.
[2024-05-23 16:37:49] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 5 ms to minimize.
[2024-05-23 16:37:50] [INFO ] Deduced a trap composed of 58 places in 249 ms of which 3 ms to minimize.
[2024-05-23 16:37:50] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 4 ms to minimize.
[2024-05-23 16:37:50] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:37:51] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:37:52] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:37:52] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-05-23 16:37:52] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:37:52] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:37:52] [INFO ] Deduced a trap composed of 75 places in 227 ms of which 3 ms to minimize.
[2024-05-23 16:37:52] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 52 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 27/52 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Detected timeout of ITS tools.
[2024-05-23 16:37:59] [INFO ] Deduced a trap composed of 42 places in 356 ms of which 4 ms to minimize.
[2024-05-23 16:37:59] [INFO ] Flatten gal took : 132 ms
[2024-05-23 16:37:59] [INFO ] Applying decomposition
[2024-05-23 16:37:59] [INFO ] Flatten gal took : 135 ms
[2024-05-23 16:37:59] [INFO ] Deduced a trap composed of 58 places in 252 ms of which 4 ms to minimize.
[2024-05-23 16:37:59] [INFO ] Deduced a trap composed of 68 places in 292 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/graph18062641476776847048.txt' '-o' '/tmp/graph18062641476776847048.bin' '-w' '/tmp/graph18062641476776847048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18062641476776847048.bin' '-l' '-1' '-v' '-w' '/tmp/graph18062641476776847048.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:38:00] [INFO ] Decomposing Gal with order
[2024-05-23 16:38:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:38:00] [INFO ] Deduced a trap composed of 75 places in 271 ms of which 3 ms to minimize.
[2024-05-23 16:38:00] [INFO ] Deduced a trap composed of 71 places in 287 ms of which 4 ms to minimize.
[2024-05-23 16:38:00] [INFO ] Removed a total of 5478 redundant transitions.
[2024-05-23 16:38:00] [INFO ] Deduced a trap composed of 70 places in 256 ms of which 3 ms to minimize.
[2024-05-23 16:38:01] [INFO ] Flatten gal took : 732 ms
[2024-05-23 16:38:01] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 4 ms to minimize.
[2024-05-23 16:38:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 405 labels/synchronizations in 258 ms.
[2024-05-23 16:38:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4183694374885100769.gal : 66 ms
[2024-05-23 16:38:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1256709554648760769.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/ReachabilityCardinality4183694374885100769.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1256709554648760769.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 ...307
[2024-05-23 16:38:01] [INFO ] Deduced a trap composed of 60 places in 264 ms of which 3 ms to minimize.
[2024-05-23 16:38:02] [INFO ] Deduced a trap composed of 86 places in 240 ms of which 3 ms to minimize.
Loading property file /tmp/ReachabilityCardinality1256709554648760769.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :7 after 8
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :8 after 9
[2024-05-23 16:38:02] [INFO ] Deduced a trap composed of 51 places in 359 ms of which 5 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :9 after 98
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :98 after 1176
[2024-05-23 16:38:02] [INFO ] Deduced a trap composed of 71 places in 390 ms of which 5 ms to minimize.
[2024-05-23 16:38:03] [INFO ] Deduced a trap composed of 44 places in 385 ms of which 5 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1176 after 17420
[2024-05-23 16:38:03] [INFO ] Deduced a trap composed of 56 places in 390 ms of which 5 ms to minimize.
[2024-05-23 16:38:04] [INFO ] Deduced a trap composed of 43 places in 388 ms of which 4 ms to minimize.
[2024-05-23 16:38:04] [INFO ] Deduced a trap composed of 81 places in 322 ms of which 4 ms to minimize.
[2024-05-23 16:38:05] [INFO ] Deduced a trap composed of 45 places in 337 ms of which 4 ms to minimize.
[2024-05-23 16:38:05] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 4 ms to minimize.
[2024-05-23 16:38:05] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 3 ms to minimize.
[2024-05-23 16:38:06] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-05-23 16:38:06] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 3 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :17420 after 51469
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :51469 after 737870
[2024-05-23 16:38:11] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:38:19] [INFO ] Deduced a trap composed of 15 places in 384 ms of which 5 ms to minimize.
[2024-05-23 16:38:20] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:38:23] [INFO ] Deduced a trap composed of 18 places in 474 ms of which 6 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 76 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 51/51 constraints]
After SMT, in 61548ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61578ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65663 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 2 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 55 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2024-05-23 16:38:23] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 16:38:23] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:38:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-23 16:38:23] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:38:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 16:38:23] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:38:23] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:38:23] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 290 ms.
RANDOM walk for 40000 steps (8 resets) in 263 ms. (151 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 376443 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 376443 steps, saw 207536 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2024-05-23 16:38:27] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-23 16:38:27] [INFO ] Computed 25 invariants in 4 ms
[2024-05-23 16:38:27] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:38:28] [INFO ] Deduced a trap composed of 47 places in 498 ms of which 4 ms to minimize.
[2024-05-23 16:38:28] [INFO ] Deduced a trap composed of 65 places in 447 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:38:29] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 247/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2489ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 118 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 380097 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 380097 steps, saw 209362 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2024-05-23 16:38:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:38:32] [INFO ] Invariant cache hit.
[2024-05-23 16:38:32] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:38:33] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1349ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 119 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 119 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-23 16:38:34] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:38:34] [INFO ] Invariant cache hit.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :737870 after 4.25659e+06
[2024-05-23 16:38:37] [INFO ] Implicit Places using invariants in 3335 ms returned []
[2024-05-23 16:38:37] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:38:37] [INFO ] Invariant cache hit.
[2024-05-23 16:38:38] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:38:41] [INFO ] Implicit Places using invariants and state equation in 3348 ms returned []
Implicit Place search using SMT with State Equation took 6686 ms to find 0 implicit places.
[2024-05-23 16:38:41] [INFO ] Redundant transitions in 71 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-23 16:38:41] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:38:41] [INFO ] Invariant cache hit.
[2024-05-23 16:38:41] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 31746ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31774ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38674 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 86 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2024-05-23 16:39:13] [INFO ] Computed 17 invariants in 2 ms
[2024-05-23 16:39:13] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:39:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-23 16:39:13] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:39:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 16:39:13] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:39:13] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:39:13] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 424 ms.
RANDOM walk for 40000 steps (8 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 354645 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 354645 steps, saw 198387 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-23 16:39:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-23 16:39:16] [INFO ] Computed 25 invariants in 19 ms
[2024-05-23 16:39:16] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:39:18] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 2 ms to minimize.
[2024-05-23 16:39:18] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:39:20] [INFO ] Deduced a trap composed of 3 places in 1506 ms of which 3 ms to minimize.
[2024-05-23 16:39:20] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 2/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3281 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 4610ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 114 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :4.25659e+06 after 9.25514e+06
Interrupted probabilistic random walk after 358992 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 358992 steps, saw 200573 distinct states, run finished after 3017 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-23 16:39:24] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:39:24] [INFO ] Invariant cache hit.
[2024-05-23 16:39:24] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:39:26] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:39:26] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 247/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:39:28] [INFO ] Deduced a trap composed of 3 places in 1073 ms of which 2 ms to minimize.
[2024-05-23 16:39:28] [INFO ] Deduced a trap composed of 3 places in 802 ms of which 10 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 2/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3424 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 4700ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 72 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 76 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-23 16:39:29] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:39:29] [INFO ] Invariant cache hit.
[2024-05-23 16:39:33] [INFO ] Implicit Places using invariants in 4423 ms returned []
[2024-05-23 16:39:33] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:39:33] [INFO ] Invariant cache hit.
[2024-05-23 16:39:34] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:39:39] [INFO ] Implicit Places using invariants and state equation in 5957 ms returned []
Implicit Place search using SMT with State Equation took 10402 ms to find 0 implicit places.
[2024-05-23 16:39:39] [INFO ] Redundant transitions in 70 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-23 16:39:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:39:39] [INFO ] Invariant cache hit.
[2024-05-23 16:39:39] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:40:04] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 10 ms to minimize.
[2024-05-23 16:40:04] [INFO ] Deduced a trap composed of 3 places in 339 ms of which 4 ms to minimize.
[2024-05-23 16:40:04] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 4 ms to minimize.
[2024-05-23 16:40:05] [INFO ] Deduced a trap composed of 3 places in 333 ms of which 4 ms to minimize.
[2024-05-23 16:40:05] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 4 ms to minimize.
[2024-05-23 16:40:05] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 2 ms to minimize.
[2024-05-23 16:40:05] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2024-05-23 16:40:05] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:40:06] [INFO ] Deduced a trap composed of 58 places in 385 ms of which 5 ms to minimize.
[2024-05-23 16:40:06] [INFO ] Deduced a trap composed of 58 places in 346 ms of which 5 ms to minimize.
[2024-05-23 16:40:07] [INFO ] Deduced a trap composed of 70 places in 356 ms of which 5 ms to minimize.
[2024-05-23 16:40:07] [INFO ] Deduced a trap composed of 58 places in 274 ms of which 4 ms to minimize.
[2024-05-23 16:40:07] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:40:07] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:40:10] [INFO ] Deduced a trap composed of 11 places in 375 ms of which 5 ms to minimize.
[2024-05-23 16:40:10] [INFO ] Deduced a trap composed of 3 places in 428 ms of which 5 ms to minimize.
[2024-05-23 16:40:10] [INFO ] Deduced a trap composed of 62 places in 335 ms of which 4 ms to minimize.
[2024-05-23 16:40:11] [INFO ] Deduced a trap composed of 58 places in 396 ms of which 4 ms to minimize.
[2024-05-23 16:40:11] [INFO ] Deduced a trap composed of 62 places in 391 ms of which 5 ms to minimize.
SMT process timed out in 31942ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31985ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42545 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 13 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 83 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2024-05-23 16:40:11] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 16:40:12] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:40:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-23 16:40:12] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:40:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 16:40:12] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:40:12] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:40:12] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 446 ms.
RANDOM walk for 40000 steps (8 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 338589 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 338589 steps, saw 190286 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-23 16:40:15] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-23 16:40:15] [INFO ] Computed 25 invariants in 5 ms
[2024-05-23 16:40:15] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:40:16] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1611ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 116 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 282 ms. (141 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 386226 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 386226 steps, saw 212604 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2024-05-23 16:40:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:40:20] [INFO ] Invariant cache hit.
[2024-05-23 16:40:20] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:40:21] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:40:21] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 2 ms to minimize.
[2024-05-23 16:40:21] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1146 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1660ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 128 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 123 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-23 16:40:22] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:40:22] [INFO ] Invariant cache hit.
[2024-05-23 16:40:23] [INFO ] Implicit Places using invariants in 999 ms returned []
[2024-05-23 16:40:23] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:40:23] [INFO ] Invariant cache hit.
[2024-05-23 16:40:23] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:40:26] [INFO ] Implicit Places using invariants and state equation in 3320 ms returned []
Implicit Place search using SMT with State Equation took 4342 ms to find 0 implicit places.
[2024-05-23 16:40:26] [INFO ] Redundant transitions in 54 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-23 16:40:26] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:40:26] [INFO ] Invariant cache hit.
[2024-05-23 16:40:26] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:40:55] [INFO ] Deduced a trap composed of 4 places in 571 ms of which 7 ms to minimize.
[2024-05-23 16:40:56] [INFO ] Deduced a trap composed of 3 places in 458 ms of which 3 ms to minimize.
[2024-05-23 16:40:56] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 2 ms to minimize.
[2024-05-23 16:40:56] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 3 ms to minimize.
[2024-05-23 16:40:56] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2024-05-23 16:40:56] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:40:57] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 2 ms to minimize.
[2024-05-23 16:40:57] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:40:57] [INFO ] Deduced a trap composed of 58 places in 250 ms of which 3 ms to minimize.
[2024-05-23 16:40:57] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 3 ms to minimize.
[2024-05-23 16:40:57] [INFO ] Deduced a trap composed of 70 places in 228 ms of which 3 ms to minimize.
[2024-05-23 16:40:58] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 3 ms to minimize.
SMT process timed out in 31386ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35941 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 27 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2024-05-23 16:40:58] [INFO ] Computed 17 invariants in 2 ms
[2024-05-23 16:40:58] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:40:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 137 ms returned sat
[2024-05-23 16:40:59] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:40:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 16:40:59] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:40:59] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:40:59] [INFO ] After 920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 985 ms.
RANDOM walk for 40000 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 360936 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 360936 steps, saw 201513 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-23 16:41:02] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-23 16:41:02] [INFO ] Computed 25 invariants in 3 ms
[2024-05-23 16:41:02] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 534 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1074ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 74 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 367614 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 367614 steps, saw 203238 distinct states, run finished after 3004 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-23 16:41:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:41:06] [INFO ] Invariant cache hit.
[2024-05-23 16:41:06] [INFO ] State equation strengthened by 284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:41:07] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:41:07] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:41:07] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2024-05-23 16:41:07] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 2/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1427ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 72 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 72 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-23 16:41:08] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:41:08] [INFO ] Invariant cache hit.
[2024-05-23 16:41:08] [INFO ] Implicit Places using invariants in 733 ms returned []
[2024-05-23 16:41:08] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:41:08] [INFO ] Invariant cache hit.
[2024-05-23 16:41:09] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:41:11] [INFO ] Implicit Places using invariants and state equation in 2946 ms returned []
Implicit Place search using SMT with State Equation took 3681 ms to find 0 implicit places.
[2024-05-23 16:41:11] [INFO ] Redundant transitions in 60 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-23 16:41:11] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 16:41:11] [INFO ] Invariant cache hit.
[2024-05-23 16:41:11] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:41:34] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 4 ms to minimize.
[2024-05-23 16:41:35] [INFO ] Deduced a trap composed of 3 places in 448 ms of which 4 ms to minimize.
[2024-05-23 16:41:35] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 3 ms to minimize.
[2024-05-23 16:41:35] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 3 ms to minimize.
[2024-05-23 16:41:35] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 2 ms to minimize.
[2024-05-23 16:41:36] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 2 ms to minimize.
[2024-05-23 16:41:36] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2024-05-23 16:41:36] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-05-23 16:41:36] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 3 ms to minimize.
[2024-05-23 16:41:36] [INFO ] Deduced a trap composed of 58 places in 262 ms of which 4 ms to minimize.
[2024-05-23 16:41:37] [INFO ] Deduced a trap composed of 70 places in 234 ms of which 3 ms to minimize.
[2024-05-23 16:41:37] [INFO ] Deduced a trap composed of 58 places in 306 ms of which 4 ms to minimize.
[2024-05-23 16:41:37] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2024-05-23 16:41:37] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:41:39] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 3 ms to minimize.
[2024-05-23 16:41:39] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 3 ms to minimize.
[2024-05-23 16:41:39] [INFO ] Deduced a trap composed of 62 places in 249 ms of which 3 ms to minimize.
[2024-05-23 16:41:40] [INFO ] Deduced a trap composed of 58 places in 260 ms of which 4 ms to minimize.
[2024-05-23 16:41:40] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 3 ms to minimize.
[2024-05-23 16:41:40] [INFO ] Deduced a trap composed of 66 places in 289 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:41:41] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 1 ms to minimize.
[2024-05-23 16:41:41] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-05-23 16:41:42] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 2 ms to minimize.
[2024-05-23 16:41:42] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:41:42] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:41:42] [INFO ] Deduced a trap composed of 75 places in 293 ms of which 3 ms to minimize.
[2024-05-23 16:41:42] [INFO ] Deduced a trap composed of 70 places in 223 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.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 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.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)
(s266timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 52 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 27/52 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:41:49] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 3 ms to minimize.
[2024-05-23 16:41:49] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 4 ms to minimize.
[2024-05-23 16:41:50] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 4 ms to minimize.
[2024-05-23 16:41:50] [INFO ] Deduced a trap composed of 75 places in 279 ms of which 3 ms to minimize.
[2024-05-23 16:41:51] [INFO ] Deduced a trap composed of 71 places in 306 ms of which 4 ms to minimize.
[2024-05-23 16:41:51] [INFO ] Deduced a trap composed of 70 places in 287 ms of which 4 ms to minimize.
[2024-05-23 16:41:51] [INFO ] Deduced a trap composed of 66 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:41:52] [INFO ] Deduced a trap composed of 60 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:41:52] [INFO ] Deduced a trap composed of 86 places in 252 ms of which 3 ms to minimize.
[2024-05-23 16:41:52] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 3 ms to minimize.
[2024-05-23 16:41:52] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 3 ms to minimize.
[2024-05-23 16:41:53] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:41:53] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 4 ms to minimize.
[2024-05-23 16:41:53] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 3 ms to minimize.
[2024-05-23 16:41:54] [INFO ] Deduced a trap composed of 81 places in 276 ms of which 3 ms to minimize.
[2024-05-23 16:41:54] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 3 ms to minimize.
[2024-05-23 16:41:54] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 3 ms to minimize.
[2024-05-23 16:41:55] [INFO ] Deduced a trap composed of 11 places in 307 ms of which 4 ms to minimize.
[2024-05-23 16:41:55] [INFO ] Deduced a trap composed of 65 places in 339 ms of which 4 ms to minimize.
[2024-05-23 16:41:55] [INFO ] Deduced a trap composed of 62 places in 290 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 16:42:01] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:42:07] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:42:07] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:42:09] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 4 ms to minimize.
[2024-05-23 16:42:11] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 77 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 52/52 constraints]
After SMT, in 61835ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61863ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65689 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 35 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2024-05-23 16:42:13] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 16:42:13] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:42:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-23 16:42:13] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:42:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 16:42:13] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:42:13] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:42:13] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 181 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1948 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 413 place count 126 transition count 286
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 469 place count 126 transition count 230
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 485 place count 118 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 493 place count 118 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 501 place count 118 transition count 214
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 557 place count 118 transition count 158
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 613 place count 62 transition count 158
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 62 transition count 158
Applied a total of 621 rules in 23 ms. Remains 62 /392 variables (removed 330) and now considering 158/2104 (removed 1946) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 158 rows 62 cols
[2024-05-23 16:42:13] [INFO ] Computed 17 invariants in 0 ms
[2024-05-23 16:42:14] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 16:42:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-23 16:42:14] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 16:42:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 16:42:14] [INFO ] After 41ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 16:42:14] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-23 16:42:14] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-23 16:42:14] [INFO ] Flatten gal took : 8 ms
[2024-05-23 16:42:14] [INFO ] Flatten gal took : 6 ms
[2024-05-23 16:42:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6652211189806101033.gal : 2 ms
[2024-05-23 16:42:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4269787164035038206.prop : 0 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/ReachabilityCardinality6652211189806101033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4269787164035038206.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 ...328
Loading property file /tmp/ReachabilityCardinality4269787164035038206.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 12
Invariant property smplace_639 does not hold.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :12 after 30
Invariant property smplace_640 does not hold.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :30 after 100
Invariant property smplace_649 does not hold.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :100 after 362
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :362 after 383
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :383 after 397
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :397 after 510
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :510 after 643
Invariant property smplace_658 does not hold.
Invariant property smplace_657 does not hold.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :643 after 5184
Invariant property smplace_666 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,72576,0.041674,5364,2,191,20,2538,6,0,409,1498,0
Total reachable state count : 72576

Verifying 6 reachability properties.
Invariant property smplace_639 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_639,6,0.042214,5364,2,72,20,2538,7,0,412,1498,0
Invariant property smplace_640 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_640,4,0.04247,5364,2,65,20,2538,8,0,414,1498,0
Invariant property smplace_649 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_649,18,0.042719,5364,2,90,20,2538,9,0,416,1498,0
Invariant property smplace_657 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_657,432,0.042972,5364,2,142,20,2538,10,0,418,1498,0
Invariant property smplace_658 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_658,648,0.043228,5364,2,144,20,2538,11,0,420,1498,0
Invariant property smplace_666 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_666,6048,0.043484,5364,2,166,20,2538,12,0,422,1498,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 431 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 16:42:14] [INFO ] Flatten gal took : 66 ms
[2024-05-23 16:42:14] [INFO ] Flatten gal took : 69 ms
[2024-05-23 16:42:14] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17059040620695292608.gal : 15 ms
[2024-05-23 16:42:14] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability334054591230408201.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/ReachabilityFireability17059040620695292608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability334054591230408201.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 ...328
Loading property file /tmp/ReachabilityFireability334054591230408201.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 22
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :22 after 29
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :29 after 53
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :53 after 206
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :206 after 272
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :272 after 519
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :519 after 1211
Detected timeout of ITS tools.
[2024-05-23 16:42:17] [INFO ] Flatten gal took : 67 ms
[2024-05-23 16:42:17] [INFO ] Applying decomposition
[2024-05-23 16:42:17] [INFO ] Flatten gal took : 65 ms
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/graph11416573504455941830.txt' '-o' '/tmp/graph11416573504455941830.bin' '-w' '/tmp/graph11416573504455941830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11416573504455941830.bin' '-l' '-1' '-v' '-w' '/tmp/graph11416573504455941830.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:42:18] [INFO ] Decomposing Gal with order
[2024-05-23 16:42:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:42:18] [INFO ] Removed a total of 4400 redundant transitions.
[2024-05-23 16:42:18] [INFO ] Flatten gal took : 354 ms
[2024-05-23 16:42:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 506 labels/synchronizations in 74 ms.
[2024-05-23 16:42:18] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3286387382324429544.gal : 17 ms
[2024-05-23 16:42:18] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7719415871399705886.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/ReachabilityFireability3286387382324429544.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7719415871399705886.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 ...307
Loading property file /tmp/ReachabilityFireability7719415871399705886.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1147
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1147 after 1152
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1152 after 1699
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1699 after 4456
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :4456 after 12527
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :12527 after 38140
Detected timeout of ITS tools.
[2024-05-23 16:42:21] [INFO ] Flatten gal took : 95 ms
[2024-05-23 16:42:22] [INFO ] Flatten gal took : 94 ms
[2024-05-23 16:42:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7287597504545831095.gal : 15 ms
[2024-05-23 16:42:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability205766561189646912.prop : 4 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/ReachabilityFireability7287597504545831095.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability205766561189646912.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 ...327
Loading property file /tmp/ReachabilityFireability205766561189646912.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 22
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :22 after 29
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :29 after 53
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :53 after 206
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :206 after 272
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :272 after 519
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :519 after 1211
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1211 after 4270
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :4270 after 12338
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :12338 after 44142
Detected timeout of ITS tools.
[2024-05-23 16:42:52] [INFO ] Flatten gal took : 62 ms
[2024-05-23 16:42:52] [INFO ] Applying decomposition
[2024-05-23 16:42:52] [INFO ] Flatten gal took : 64 ms
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/graph5236853512699186468.txt' '-o' '/tmp/graph5236853512699186468.bin' '-w' '/tmp/graph5236853512699186468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5236853512699186468.bin' '-l' '-1' '-v' '-w' '/tmp/graph5236853512699186468.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:42:52] [INFO ] Decomposing Gal with order
[2024-05-23 16:42:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:42:52] [INFO ] Removed a total of 4320 redundant transitions.
[2024-05-23 16:42:52] [INFO ] Flatten gal took : 220 ms
[2024-05-23 16:42:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 556 labels/synchronizations in 62 ms.
[2024-05-23 16:42:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15804120897959992057.gal : 16 ms
[2024-05-23 16:42:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3882071090077784405.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/ReachabilityFireability15804120897959992057.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3882071090077784405.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
Loading property file /tmp/ReachabilityFireability3882071090077784405.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 18826
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :18826 after 108896
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :108896 after 113033
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :113033 after 208763
Detected timeout of ITS tools.
[2024-05-23 16:43:23] [INFO ] Flatten gal took : 58 ms
[2024-05-23 16:43:23] [INFO ] Flatten gal took : 59 ms
[2024-05-23 16:43:23] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14295478580607869120.gal : 9 ms
[2024-05-23 16:43:23] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6441207468166652229.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/ReachabilityFireability14295478580607869120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6441207468166652229.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 ...329
Loading property file /tmp/ReachabilityFireability6441207468166652229.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 22
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :22 after 29
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :29 after 53
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :53 after 206
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :206 after 272
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :272 after 519
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :519 after 1211
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1211 after 4270
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :4270 after 12338
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :12338 after 44142
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :44142 after 79427
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :79427 after 126954
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :126954 after 469301
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :469301 after 958876
Detected timeout of ITS tools.
[2024-05-23 16:48:23] [INFO ] Flatten gal took : 71 ms
[2024-05-23 16:48:23] [INFO ] Applying decomposition
[2024-05-23 16:48:23] [INFO ] Flatten gal took : 61 ms
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/graph8268197845865754149.txt' '-o' '/tmp/graph8268197845865754149.bin' '-w' '/tmp/graph8268197845865754149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8268197845865754149.bin' '-l' '-1' '-v' '-w' '/tmp/graph8268197845865754149.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:48:23] [INFO ] Decomposing Gal with order
[2024-05-23 16:48:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:48:23] [INFO ] Removed a total of 4362 redundant transitions.
[2024-05-23 16:48:23] [INFO ] Flatten gal took : 220 ms
[2024-05-23 16:48:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 501 labels/synchronizations in 96 ms.
[2024-05-23 16:48:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5436754831609501205.gal : 37 ms
[2024-05-23 16:48:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2917630334699774386.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/ReachabilityFireability5436754831609501205.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2917630334699774386.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 ...307
Loading property file /tmp/ReachabilityFireability2917630334699774386.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 177
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :177 after 536
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :536 after 1054
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1054 after 25242
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :25242 after 242058
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :242058 after 1.65954e+06
Invariant property smplace_666 does not hold.
Invariant property smplace_658 does not hold.
Invariant property smplace_657 does not hold.
Invariant property smplace_649 does not hold.
Invariant property smplace_640 does not hold.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.65954e+06 after 4.76143e+07
Detected timeout of ITS tools.
[2024-05-23 16:53:24] [INFO ] Flatten gal took : 125 ms
[2024-05-23 16:53:24] [INFO ] Flatten gal took : 118 ms
[2024-05-23 16:53:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11252287082194974683.gal : 29 ms
[2024-05-23 16:53:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12778303124609598839.prop : 4 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/ReachabilityFireability11252287082194974683.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12778303124609598839.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/ReachabilityFireability12778303124609598839.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 53
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :53 after 206
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :206 after 272
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :272 after 519
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :519 after 1211
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1211 after 4270
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4270 after 12338
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :12338 after 44142
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :44142 after 79427
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :79427 after 126954
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :126954 after 469301
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :469301 after 958876

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-08"
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-08, 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-171636275100118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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