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.r561-tall-171734906400203.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 FireWire-PT-20, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r561-tall-171734906400203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 247K Jun 2 16:33 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 1717354060075

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-06-02 18:47:41] [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-06-02 18:47:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:47:41] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-06-02 18:47:41] [INFO ] Transformed 626 places.
[2024-06-02 18:47:41] [INFO ] Transformed 1031 transitions.
[2024-06-02 18:47:41] [INFO ] Found NUPN structural information;
[2024-06-02 18:47:41] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 210 ms.
Graph (trivial) has 458 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 5 ms
Free SCC test removed 9 places
Structural test allowed to assert that 93 places are NOT stable. Took 25 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
[2024-06-02 18:47:42] [INFO ] Flatten gal took : 228 ms
[2024-06-02 18:47:42] [INFO ] Flatten gal took : 87 ms
[2024-06-02 18:47:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality497840825197804397.gal : 47 ms
[2024-06-02 18:47:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9460807137317726104.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/ReachabilityCardinality497840825197804397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9460807137317726104.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
RANDOM walk for 40000 steps (452 resets) in 3580 ms. (11 steps per ms) remains 387/533 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 27 ms. (14 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 387/387 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 387/387 properties
Loading property file /tmp/ReachabilityCardinality9460807137317726104.prop.
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 387/387 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 387/387 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 387/387 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 387/387 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 387/387 properties
[2024-06-02 18:47:42] [INFO ] Flow matrix only has 1019 transitions (discarded 2 similar events)
// Phase 1: matrix 1019 rows 617 cols
[2024-06-02 18:47:42] [INFO ] Computed 13 invariants in 20 ms
[2024-06-02 18:47:42] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,533 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,533 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,533 properties remain. new max is 16
SDD size :3 after 14
Invariant property smplace_102 does not hold.
Invariant property smplace_72 does not hold.
Invariant property smplace_68 does not hold.
Invariant property smplace_64 does not hold.
SDD proceeding with computation,529 properties remain. new max is 16
SDD size :14 after 60
Invariant property smplace_100 does not hold.
SDD proceeding with computation,528 properties remain. new max is 16
SDD size :60 after 93
SDD proceeding with computation,528 properties remain. new max is 32
SDD size :93 after 178
SDD proceeding with computation,528 properties remain. new max is 64
SDD size :178 after 264
SDD proceeding with computation,528 properties remain. new max is 128
SDD size :264 after 349
Invariant property smplace_237 does not hold.
Invariant property smplace_99 does not hold.
Invariant property smplace_98 does not hold.
Invariant property smplace_96 does not hold.
Invariant property smplace_95 does not hold.
SDD proceeding with computation,523 properties remain. new max is 128
SDD size :349 after 737
Invariant property smplace_235 does not hold.
Invariant property smplace_234 does not hold.
Invariant property smplace_233 does not hold.
Invariant property smplace_232 does not hold.
Invariant property smplace_48 does not hold.
Invariant property smplace_47 does not hold.
Invariant property smplace_46 does not hold.
Invariant property smplace_45 does not hold.
Invariant property smplace_44 does not hold.
Invariant property smplace_43 does not hold.
Invariant property smplace_25 does not hold.
Invariant property smplace_19 does not hold.
Invariant property smplace_18 does not hold.
Invariant property smplace_14 does not hold.
Invariant property smplace_13 does not hold.
Invariant property smplace_12 does not hold.
SDD proceeding with computation,507 properties remain. new max is 128
SDD size :737 after 4192
Invariant property smplace_231 does not hold.
Invariant property smplace_230 does not hold.
Invariant property smplace_42 does not hold.
Invariant property smplace_41 does not hold.
Invariant property smplace_24 does not hold.
Invariant property smplace_17 does not hold.
Invariant property smplace_10 does not hold.
SDD proceeding with computation,500 properties remain. new max is 128
SDD size :4192 after 5064
Invariant property smplace_183 does not hold.
Invariant property smplace_23 does not hold.
Invariant property smplace_22 does not hold.
Invariant property smplace_3 does not hold.
Invariant property smplace_2 does not hold.
SDD proceeding with computation,495 properties remain. new max is 128
SDD size :5064 after 6287
Invariant property smplace_229 does not hold.
Invariant property smplace_228 does not hold.
Invariant property smplace_40 does not hold.
Invariant property smplace_28 does not hold.
Invariant property smplace_27 does not hold.
Invariant property smplace_26 does not hold.
SDD proceeding with computation,489 properties remain. new max is 128
SDD size :6287 after 8249
Invariant property smplace_227 does not hold.
Invariant property smplace_226 does not hold.
SDD proceeding with computation,487 properties remain. new max is 128
SDD size :8249 after 10429
Invariant property smplace_225 does not hold.
Invariant property smplace_224 does not hold.
SDD proceeding with computation,485 properties remain. new max is 128
SDD size :10429 after 12609
Invariant property smplace_223 does not hold.
Invariant property smplace_222 does not hold.
SDD proceeding with computation,483 properties remain. new max is 128
SDD size :12609 after 14789
Invariant property smplace_221 does not hold.
Invariant property smplace_220 does not hold.
Invariant property smplace_219 does not hold.
Invariant property smplace_218 does not hold.
Invariant property smplace_97 does not hold.
Invariant property smplace_63 does not hold.
Invariant property smplace_62 does not hold.
Invariant property smplace_61 does not hold.
Invariant property smplace_59 does not hold.
SDD proceeding with computation,474 properties remain. new max is 128
SDD size :14789 after 17106
Invariant property smplace_217 does not hold.
SDD proceeding with computation,473 properties remain. new max is 128
SDD size :17106 after 17367
SDD proceeding with computation,473 properties remain. new max is 256
SDD size :17367 after 24105
Invariant property smplace_6 does not hold.
Invariant property smplace_5 does not hold.
SDD proceeding with computation,471 properties remain. new max is 256
SDD size :24105 after 28401
SDD proceeding with computation,471 properties remain. new max is 512
SDD size :28401 after 30741
SDD proceeding with computation,471 properties remain. new max is 1024
SDD size :30741 after 33413
Invariant property smplace_60 does not hold.
Invariant property smplace_58 does not hold.
SDD proceeding with computation,469 properties remain. new max is 1024
SDD size :33413 after 42613
SDD proceeding with computation,469 properties remain. new max is 2048
SDD size :42613 after 48325
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/1636 variables, and 387 constraints, problems are : Problem set: 16 solved, 371 unsolved in 5103 ms.
Refiners :[Domain max(s): 387/617 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 371 unsolved
Invariant property smplace_57 does not hold.
SDD proceeding with computation,468 properties remain. new max is 2048
SDD size :48325 after 56461
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 371/371 constraints. Problems are: Problem set: 17 solved, 370 unsolved
SDD proceeding with computation,468 properties remain. new max is 4096
SDD size :56461 after 60005
Invariant property smplace_216 does not hold.
Invariant property smplace_215 does not hold.
Invariant property smplace_214 does not hold.
Invariant property smplace_213 does not hold.
Invariant property smplace_212 does not hold.
Invariant property smplace_211 does not hold.
Invariant property smplace_210 does not hold.
Invariant property smplace_209 does not hold.
Invariant property smplace_208 does not hold.
Invariant property smplace_207 does not hold.
Invariant property smplace_206 does not hold.
Invariant property smplace_205 does not hold.
Invariant property smplace_204 does not hold.
Invariant property smplace_203 does not hold.
Invariant property smplace_202 does not hold.
Invariant property smplace_201 does not hold.
Invariant property smplace_197 does not hold.
Invariant property smplace_196 does not hold.
Invariant property smplace_187 does not hold.
Invariant property smplace_186 does not hold.
Invariant property smplace_185 does not hold.
Invariant property smplace_184 does not hold.
Invariant property smplace_182 does not hold.
Invariant property smplace_181 does not hold.
Invariant property smplace_180 does not hold.
Invariant property smplace_179 does not hold.
Invariant property smplace_178 does not hold.
Invariant property smplace_177 does not hold.
Invariant property smplace_176 does not hold.
Invariant property smplace_175 does not hold.
Invariant property smplace_105 does not hold.
Invariant property smplace_93 does not hold.
Invariant property smplace_37 does not hold.
Invariant property smplace_21 does not hold.
Invariant property smplace_20 does not hold.
SDD proceeding with computation,433 properties remain. new max is 4096
SDD size :60005 after 179611
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 0/371 constraints. Problems are: Problem set: 37 solved, 350 unsolved
At refinement iteration 2 (OVERLAPS) 246/617 variables, 13/384 constraints. Problems are: Problem set: 37 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 246/630 constraints. Problems are: Problem set: 37 solved, 350 unsolved
[2024-06-02 18:47:50] [INFO ] Deduced a trap composed of 56 places in 285 ms of which 34 ms to minimize.
[2024-06-02 18:47:51] [INFO ] Deduced a trap composed of 55 places in 278 ms of which 4 ms to minimize.
[2024-06-02 18:47:51] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 4 ms to minimize.
[2024-06-02 18:47:51] [INFO ] Deduced a trap composed of 154 places in 242 ms of which 4 ms to minimize.
Invariant property smplace_195 does not hold.
Invariant property smplace_194 does not hold.
Invariant property smplace_193 does not hold.
Invariant property smplace_192 does not hold.
Invariant property smplace_191 does not hold.
Invariant property smplace_190 does not hold.
Invariant property smplace_189 does not hold.
Invariant property smplace_188 does not hold.
Invariant property smplace_174 does not hold.
Invariant property smplace_173 does not hold.
Invariant property smplace_172 does not hold.
Invariant property smplace_171 does not hold.
Invariant property smplace_170 does not hold.
Invariant property smplace_169 does not hold.
Invariant property smplace_168 does not hold.
Invariant property smplace_167 does not hold.
Invariant property smplace_166 does not hold.
[2024-06-02 18:47:52] [INFO ] Deduced a trap composed of 133 places in 253 ms of which 4 ms to minimize.
[2024-06-02 18:47:52] [INFO ] Deduced a trap composed of 119 places in 73 ms of which 1 ms to minimize.
Invariant property smplace_111 does not hold.
Invariant property smplace_110 does not hold.
Invariant property smplace_109 does not hold.
Invariant property smplace_108 does not hold.
Invariant property smplace_107 does not hold.
Invariant property smplace_106 does not hold.
Invariant property smplace_94 does not hold.
[2024-06-02 18:47:52] [INFO ] Deduced a trap composed of 117 places in 73 ms of which 2 ms to minimize.
SDD proceeding with computation,409 properties remain. new max is 4096
SDD size :179611 after 248493
[2024-06-02 18:47:52] [INFO ] Deduced a trap composed of 92 places in 233 ms of which 4 ms to minimize.
Invariant property smplace_165 does not hold.
Invariant property smplace_164 does not hold.
Invariant property smplace_163 does not hold.
Invariant property smplace_162 does not hold.
Invariant property smplace_161 does not hold.
Invariant property smplace_160 does not hold.
Invariant property smplace_159 does not hold.
Invariant property smplace_158 does not hold.
Invariant property smplace_157 does not hold.
[2024-06-02 18:47:53] [INFO ] Deduced a trap composed of 128 places in 237 ms of which 4 ms to minimize.
SMT process timed out in 10464ms, After SMT, problems are : Problem set: 37 solved, 350 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 327 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1021/1021 transitions.
Graph (complete) has 1871 edges and 617 vertex of which 608 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 608 transition count 947
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 147 place count 538 transition count 945
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 537 transition count 945
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 148 place count 537 transition count 935
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 168 place count 527 transition count 935
Invariant property smplace_121 does not hold.
Invariant property smplace_120 does not hold.
Invariant property smplace_118 does not hold.
Invariant property smplace_117 does not hold.
Invariant property smplace_116 does not hold.
Invariant property smplace_115 does not hold.
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 197 place count 498 transition count 904
Invariant property smplace_114 does not hold.
Invariant property smplace_113 does not hold.
Invariant property smplace_112 does not hold.
Invariant property smplace_101 does not hold.
Invariant property smplace_90 does not hold.
Iterating global reduction 3 with 29 rules applied. Total rules applied 226 place count 498 transition count 904
Invariant property smplace_89 does not hold.
Invariant property smplace_88 does not hold.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 229 place count 498 transition count 901
Invariant property smplace_86 does not hold.
Invariant property smplace_85 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_83 does not hold.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 229 place count 498 transition count 900
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 497 transition count 900
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 238 place count 490 transition count 806
Iterating global reduction 4 with 7 rules applied. Total rules applied 245 place count 490 transition count 806
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 247 place count 490 transition count 804
SDD proceeding with computation,383 properties remain. new max is 4096
SDD size :248493 after 392438
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 248 place count 489 transition count 802
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 489 transition count 802
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 309 place count 459 transition count 772
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 347 place count 440 transition count 807
Free-agglomeration rule applied 22 times.
Iterating global reduction 5 with 22 rules applied. Total rules applied 369 place count 440 transition count 785
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 396 place count 418 transition count 780
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 398 place count 416 transition count 778
Iterating global reduction 6 with 2 rules applied. Total rules applied 400 place count 416 transition count 778
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 403 place count 416 transition count 775
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 413 place count 416 transition count 765
Applied a total of 413 rules in 298 ms. Remains 416 /617 variables (removed 201) and now considering 765/1021 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 416/617 places, 765/1021 transitions.
SDD proceeding with computation,383 properties remain. new max is 8192
SDD size :392438 after 565535
SDD proceeding with computation,383 properties remain. new max is 16384
SDD size :565535 after 881617
Invariant property smplace_200 does not hold.
Invariant property smplace_199 does not hold.
Invariant property smplace_198 does not hold.
Invariant property smplace_156 does not hold.
Invariant property smplace_155 does not hold.
Invariant property smplace_154 does not hold.
Invariant property smplace_153 does not hold.
Invariant property smplace_152 does not hold.
Invariant property smplace_151 does not hold.
Invariant property smplace_150 does not hold.
Invariant property smplace_149 does not hold.
Invariant property smplace_148 does not hold.
Invariant property smplace_147 does not hold.
Invariant property smplace_146 does not hold.
Invariant property smplace_145 does not hold.
Invariant property smplace_144 does not hold.
Invariant property smplace_143 does not hold.
Invariant property smplace_142 does not hold.
Invariant property smplace_141 does not hold.
Invariant property smplace_140 does not hold.
Invariant property smplace_139 does not hold.
Invariant property smplace_138 does not hold.
Invariant property smplace_137 does not hold.
Invariant property smplace_136 does not hold.
Invariant property smplace_135 does not hold.
Invariant property smplace_134 does not hold.
Invariant property smplace_133 does not hold.
Invariant property smplace_132 does not hold.
Invariant property smplace_131 does not hold.
Invariant property smplace_130 does not hold.
Invariant property smplace_129 does not hold.
Invariant property smplace_128 does not hold.
Invariant property smplace_127 does not hold.
Invariant property smplace_126 does not hold.
Invariant property smplace_125 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_123 does not hold.
Invariant property smplace_122 does not hold.
Invariant property smplace_119 does not hold.
Invariant property smplace_87 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
Invariant property smplace_34 does not hold.
Invariant property smplace_33 does not hold.
Invariant property smplace_29 does not hold.
Invariant property smplace_16 does not hold.
Invariant property smplace_15 does not hold.
Invariant property smplace_11 does not hold.
Invariant property smplace_9 does not hold.
Invariant property smplace_8 does not hold.
Invariant property smplace_7 does not hold.
Invariant property smplace_4 does not hold.
SDD proceeding with computation,331 properties remain. new max is 16384
SDD size :881617 after 2.45642e+06
SDD proceeding with computation,331 properties remain. new max is 32768
SDD size :2.45642e+06 after 2.92295e+06
RANDOM walk for 4000000 steps (185719 resets) in 67730 ms. (59 steps per ms) remains 145/311 properties
BEST_FIRST walk for 40004 steps (339 resets) in 141 ms. (281 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (336 resets) in 133 ms. (298 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40002 steps (335 resets) in 137 ms. (289 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40002 steps (347 resets) in 125 ms. (317 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (340 resets) in 141 ms. (281 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (341 resets) in 122 ms. (325 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (355 resets) in 129 ms. (307 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (335 resets) in 113 ms. (350 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (348 resets) in 131 ms. (303 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (329 resets) in 139 ms. (285 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (339 resets) in 113 ms. (350 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (338 resets) in 117 ms. (339 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (341 resets) in 139 ms. (285 steps per ms) remains 144/145 properties
BEST_FIRST walk for 40003 steps (332 resets) in 132 ms. (300 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (343 resets) in 130 ms. (305 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (330 resets) in 117 ms. (339 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40002 steps (333 resets) in 144 ms. (275 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (329 resets) in 106 ms. (373 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (358 resets) in 106 ms. (373 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (322 resets) in 133 ms. (298 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40002 steps (342 resets) in 144 ms. (275 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (343 resets) in 114 ms. (347 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (350 resets) in 136 ms. (292 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (331 resets) in 128 ms. (310 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (330 resets) in 133 ms. (298 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (342 resets) in 135 ms. (294 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (328 resets) in 135 ms. (294 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (345 resets) in 143 ms. (277 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (345 resets) in 141 ms. (281 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (325 resets) in 132 ms. (300 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (332 resets) in 119 ms. (333 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (339 resets) in 135 ms. (294 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (339 resets) in 143 ms. (277 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (339 resets) in 128 ms. (310 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40004 steps (346 resets) in 141 ms. (281 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40002 steps (330 resets) in 122 ms. (325 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40002 steps (343 resets) in 135 ms. (294 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (339 resets) in 138 ms. (287 steps per ms) remains 142/144 properties
BEST_FIRST walk for 40003 steps (335 resets) in 147 ms. (270 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (347 resets) in 131 ms. (303 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (334 resets) in 144 ms. (275 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (340 resets) in 161 ms. (246 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (328 resets) in 143 ms. (277 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (339 resets) in 140 ms. (283 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (345 resets) in 146 ms. (272 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (339 resets) in 147 ms. (270 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (357 resets) in 149 ms. (266 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (342 resets) in 154 ms. (258 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (345 resets) in 141 ms. (281 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (322 resets) in 142 ms. (279 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (343 resets) in 144 ms. (275 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (327 resets) in 146 ms. (272 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (325 resets) in 136 ms. (292 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (342 resets) in 147 ms. (270 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (330 resets) in 134 ms. (296 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (335 resets) in 127 ms. (312 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (327 resets) in 149 ms. (266 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (341 resets) in 143 ms. (277 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (348 resets) in 147 ms. (270 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (334 resets) in 143 ms. (277 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (354 resets) in 152 ms. (261 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (350 resets) in 142 ms. (279 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (355 resets) in 148 ms. (268 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (332 resets) in 136 ms. (292 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (340 resets) in 132 ms. (300 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (320 resets) in 152 ms. (261 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (343 resets) in 153 ms. (259 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (331 resets) in 166 ms. (239 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (344 resets) in 149 ms. (266 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (348 resets) in 136 ms. (291 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (339 resets) in 137 ms. (289 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (335 resets) in 152 ms. (261 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (340 resets) in 153 ms. (259 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (341 resets) in 158 ms. (251 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (352 resets) in 136 ms. (292 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (333 resets) in 158 ms. (251 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (327 resets) in 148 ms. (268 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (338 resets) in 148 ms. (268 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (332 resets) in 143 ms. (277 steps per ms) remains 142/142 properties
SDD proceeding with computation,331 properties remain. new max is 65536
SDD size :2.92295e+06 after 4.03171e+06
BEST_FIRST walk for 40004 steps (352 resets) in 148 ms. (268 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (347 resets) in 145 ms. (273 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (328 resets) in 139 ms. (285 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (321 resets) in 134 ms. (296 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (354 resets) in 147 ms. (270 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (328 resets) in 150 ms. (264 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (336 resets) in 144 ms. (275 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (344 resets) in 143 ms. (277 steps per ms) remains 142/142 properties
[2024-06-02 18:48:18] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
// Phase 1: matrix 761 rows 416 cols
[2024-06-02 18:48:18] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 18:48:18] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 177/292 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 111/403 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 759/1162 variables, 403/413 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1162 variables, 42/455 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1162 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 15/1177 variables, 13/468 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1177 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/1177 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1177/1177 variables, and 468 constraints, problems are : Problem set: 0 solved, 115 unsolved in 8312 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 416/416 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 177/292 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:48:27] [INFO ] Deduced a trap composed of 107 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:48:27] [INFO ] Deduced a trap composed of 121 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:48:27] [INFO ] Deduced a trap composed of 103 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:48:27] [INFO ] Deduced a trap composed of 124 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:48:27] [INFO ] Deduced a trap composed of 106 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:48:28] [INFO ] Deduced a trap composed of 94 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:48:28] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:48:28] [INFO ] Deduced a trap composed of 123 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:48:28] [INFO ] Deduced a trap composed of 126 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:48:29] [INFO ] Deduced a trap composed of 110 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:48:29] [INFO ] Deduced a trap composed of 121 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:48:29] [INFO ] Deduced a trap composed of 108 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:48:30] [INFO ] Deduced a trap composed of 96 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:48:31] [INFO ] Deduced a trap composed of 112 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 111/403 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:48:32] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
[2024-06-02 18:48:32] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
Invariant property smplace_423 does not hold.
Invariant property smplace_422 does not hold.
Invariant property smplace_421 does not hold.
Invariant property smplace_420 does not hold.
Invariant property smplace_419 does not hold.
Invariant property smplace_418 does not hold.
Invariant property smplace_417 does not hold.
Invariant property smplace_416 does not hold.
Invariant property smplace_415 does not hold.
Invariant property smplace_414 does not hold.
Invariant property smplace_413 does not hold.
Invariant property smplace_412 does not hold.
Invariant property smplace_411 does not hold.
Invariant property smplace_410 does not hold.
Invariant property smplace_409 does not hold.
Invariant property smplace_408 does not hold.
Invariant property smplace_405 does not hold.
Invariant property smplace_371 does not hold.
Invariant property smplace_370 does not hold.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:48:33] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
Invariant property smplace_39 does not hold.
Invariant property smplace_38 does not hold.
Invariant property smplace_36 does not hold.
Invariant property smplace_35 does not hold.
Invariant property smplace_32 does not hold.
Invariant property smplace_31 does not hold.
Invariant property smplace_30 does not hold.
SDD proceeding with computation,305 properties remain. new max is 65536
SDD size :4.03171e+06 after 6.17915e+07
[2024-06-02 18:48:34] [INFO ] Deduced a trap composed of 119 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:48:34] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:48:34] [INFO ] Deduced a trap composed of 104 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:48:34] [INFO ] Deduced a trap composed of 103 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 759/1162 variables, 403/434 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1162 variables, 42/476 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1162 variables, 115/591 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:48:40] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 2 ms to minimize.
[2024-06-02 18:48:40] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 2 ms to minimize.
[2024-06-02 18:48:40] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1162 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1162 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 115 unsolved
SDD proceeding with computation,305 properties remain. new max is 131072
SDD size :6.17915e+07 after 8.13779e+07
At refinement iteration 15 (OVERLAPS) 15/1177 variables, 13/607 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1177 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:49:04] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/1177 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/1177 variables, and 608 constraints, problems are : Problem set: 0 solved, 115 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 416/416 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 25/25 constraints]
After SMT, in 53371ms problems are : Problem set: 0 solved, 115 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 765/765 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 416 transition count 719
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 370 transition count 719
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 92 place count 370 transition count 715
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 366 transition count 715
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 118 place count 348 transition count 694
Iterating global reduction 2 with 18 rules applied. Total rules applied 136 place count 348 transition count 694
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 136 place count 348 transition count 692
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 346 transition count 692
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 146 place count 340 transition count 680
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 340 transition count 680
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 338 transition count 678
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 338 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 160 place count 338 transition count 674
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 162 place count 336 transition count 674
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 210 place count 312 transition count 650
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 211 place count 311 transition count 649
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 311 transition count 649
Performed 18 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 248 place count 293 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 252 place count 293 transition count 686
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 253 place count 292 transition count 680
Iterating global reduction 5 with 1 rules applied. Total rules applied 254 place count 292 transition count 680
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 255 place count 291 transition count 678
Iterating global reduction 5 with 1 rules applied. Total rules applied 256 place count 291 transition count 678
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 257 place count 290 transition count 675
Iterating global reduction 5 with 1 rules applied. Total rules applied 258 place count 290 transition count 675
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 259 place count 289 transition count 673
Iterating global reduction 5 with 1 rules applied. Total rules applied 260 place count 289 transition count 673
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 261 place count 288 transition count 670
Iterating global reduction 5 with 1 rules applied. Total rules applied 262 place count 288 transition count 670
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 263 place count 287 transition count 668
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 287 transition count 668
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 265 place count 286 transition count 665
Iterating global reduction 5 with 1 rules applied. Total rules applied 266 place count 286 transition count 665
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 267 place count 285 transition count 663
Iterating global reduction 5 with 1 rules applied. Total rules applied 268 place count 285 transition count 663
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 269 place count 284 transition count 660
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 284 transition count 660
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 271 place count 283 transition count 658
Iterating global reduction 5 with 1 rules applied. Total rules applied 272 place count 283 transition count 658
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 273 place count 282 transition count 656
Iterating global reduction 5 with 1 rules applied. Total rules applied 274 place count 282 transition count 656
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 275 place count 281 transition count 654
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 281 transition count 654
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 290 place count 281 transition count 640
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 301 place count 281 transition count 629
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 315 place count 270 transition count 626
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 316 place count 270 transition count 625
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 319 place count 270 transition count 802
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 322 place count 267 transition count 802
Applied a total of 322 rules in 175 ms. Remains 267 /416 variables (removed 149) and now considering 802/765 (removed -37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 267/416 places, 802/765 transitions.
Invariant property smplace_407 does not hold.
Invariant property smplace_404 does not hold.
Invariant property smplace_403 does not hold.
Invariant property smplace_402 does not hold.
Invariant property smplace_401 does not hold.
Invariant property smplace_400 does not hold.
Invariant property smplace_399 does not hold.
Invariant property smplace_385 does not hold.
Invariant property smplace_384 does not hold.
Invariant property smplace_383 does not hold.
Invariant property smplace_369 does not hold.
Invariant property smplace_368 does not hold.
Invariant property smplace_367 does not hold.
Invariant property smplace_363 does not hold.
Invariant property smplace_362 does not hold.
Invariant property smplace_361 does not hold.
Invariant property smplace_360 does not hold.
Invariant property smplace_359 does not hold.
Invariant property smplace_358 does not hold.
Invariant property smplace_357 does not hold.
Invariant property smplace_356 does not hold.
Invariant property smplace_355 does not hold.
Invariant property smplace_354 does not hold.
Invariant property smplace_353 does not hold.
Invariant property smplace_352 does not hold.
Invariant property smplace_351 does not hold.
Invariant property smplace_350 does not hold.
Invariant property smplace_300 does not hold.
Invariant property smplace_299 does not hold.
Invariant property smplace_298 does not hold.
Invariant property smplace_297 does not hold.
SDD proceeding with computation,274 properties remain. new max is 131072
SDD size :8.13779e+07 after 3.28129e+08
RANDOM walk for 4000000 steps (85695 resets) in 39850 ms. (100 steps per ms) remains 49/115 properties
BEST_FIRST walk for 400004 steps (1817 resets) in 872 ms. (458 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (1850 resets) in 871 ms. (458 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (1839 resets) in 1190 ms. (335 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (1818 resets) in 885 ms. (451 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (1821 resets) in 1125 ms. (355 steps per ms) remains 45/49 properties
BEST_FIRST walk for 400002 steps (1788 resets) in 846 ms. (472 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1791 resets) in 999 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1805 resets) in 1103 ms. (362 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1844 resets) in 888 ms. (449 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1768 resets) in 1171 ms. (341 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1798 resets) in 1134 ms. (352 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1815 resets) in 974 ms. (410 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1828 resets) in 1125 ms. (355 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1800 resets) in 919 ms. (434 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1792 resets) in 1142 ms. (349 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1809 resets) in 957 ms. (417 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1825 resets) in 1089 ms. (366 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1783 resets) in 883 ms. (452 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1804 resets) in 953 ms. (419 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1819 resets) in 888 ms. (449 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1784 resets) in 1119 ms. (357 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1833 resets) in 1108 ms. (360 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1845 resets) in 842 ms. (474 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1821 resets) in 1123 ms. (355 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1820 resets) in 1260 ms. (317 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1785 resets) in 1203 ms. (332 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1812 resets) in 925 ms. (431 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1775 resets) in 1177 ms. (339 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1825 resets) in 877 ms. (455 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1834 resets) in 1046 ms. (382 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1827 resets) in 850 ms. (470 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1839 resets) in 1263 ms. (316 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1820 resets) in 1019 ms. (392 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1783 resets) in 1208 ms. (330 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1822 resets) in 1256 ms. (318 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1745 resets) in 1214 ms. (329 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1835 resets) in 1184 ms. (337 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1803 resets) in 1030 ms. (387 steps per ms) remains 40/45 properties
BEST_FIRST walk for 400003 steps (1786 resets) in 1214 ms. (329 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (1848 resets) in 1136 ms. (351 steps per ms) remains 40/40 properties
[2024-06-02 18:49:39] [INFO ] Flow matrix only has 793 transitions (discarded 9 similar events)
// Phase 1: matrix 793 rows 267 cols
[2024-06-02 18:49:39] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:49:39] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 144/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 67/251 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 789/1040 variables, 251/261 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1040 variables, 96/357 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1040 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 18/1058 variables, 14/371 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1058 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 2/1060 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1060 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 0/1060 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1060/1060 variables, and 373 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2759 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 267/267 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 144/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 18:49:42] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 6 ms to minimize.
[2024-06-02 18:49:42] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:49:42] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 67/251 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 18:49:42] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:49:42] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:49:42] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:49:42] [INFO ] Deduced a trap composed of 67 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:49:42] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 789/1040 variables, 251/269 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1040 variables, 96/365 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1040 variables, 40/405 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 18:49:43] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 1 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1040 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Invariant property smplace_611 does not hold.
Invariant property smplace_610 does not hold.
Invariant property smplace_609 does not hold.
Invariant property smplace_608 does not hold.
Invariant property smplace_607 does not hold.
At refinement iteration 11 (INCLUDED_ONLY) 0/1040 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Invariant property smplace_606 does not hold.
Invariant property smplace_605 does not hold.
Invariant property smplace_604 does not hold.
Invariant property smplace_603 does not hold.
Invariant property smplace_602 does not hold.
Invariant property smplace_601 does not hold.
Invariant property smplace_600 does not hold.
Invariant property smplace_599 does not hold.
Invariant property smplace_598 does not hold.
Invariant property smplace_597 does not hold.
Invariant property smplace_596 does not hold.
Invariant property smplace_593 does not hold.
At refinement iteration 12 (OVERLAPS) 18/1058 variables, 14/422 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Invariant property smplace_559 does not hold.
Invariant property smplace_558 does not hold.
Invariant property smplace_398 does not hold.
Invariant property smplace_397 does not hold.
Invariant property smplace_395 does not hold.
Invariant property smplace_393 does not hold.
Invariant property smplace_392 does not hold.
Invariant property smplace_391 does not hold.
Invariant property smplace_390 does not hold.
Invariant property smplace_389 does not hold.
Invariant property smplace_388 does not hold.
Invariant property smplace_387 does not hold.
Invariant property smplace_386 does not hold.
Invariant property smplace_382 does not hold.
Invariant property smplace_380 does not hold.
Invariant property smplace_379 does not hold.
Invariant property smplace_377 does not hold.
Invariant property smplace_375 does not hold.
Invariant property smplace_373 does not hold.
Invariant property smplace_366 does not hold.
Invariant property smplace_365 does not hold.
Invariant property smplace_364 does not hold.
Invariant property smplace_349 does not hold.
Invariant property smplace_348 does not hold.
Invariant property smplace_347 does not hold.
Invariant property smplace_346 does not hold.
At refinement iteration 13 (INCLUDED_ONLY) 0/1058 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 2/1060 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Invariant property smplace_309 does not hold.
Invariant property smplace_301 does not hold.
Invariant property smplace_296 does not hold.
Invariant property smplace_295 does not hold.
Invariant property smplace_294 does not hold.
Invariant property smplace_293 does not hold.
SDD proceeding with computation,225 properties remain. new max is 131072
SDD size :3.28129e+08 after 1.62608e+09
At refinement iteration 15 (INCLUDED_ONLY) 0/1060 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 16 (OVERLAPS) 0/1060 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1060/1060 variables, and 424 constraints, problems are : Problem set: 0 solved, 40 unsolved in 7707 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 267/267 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 11/11 constraints]
After SMT, in 10500ms problems are : Problem set: 0 solved, 40 unsolved
Fused 40 Parikh solutions to 39 different solutions.
Parikh walk visited 0 properties in 4142 ms.
Support contains 40 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 802/802 transitions.
Graph (complete) has 1266 edges and 267 vertex of which 265 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 265 transition count 797
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 262 transition count 797
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 262 transition count 796
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 261 transition count 796
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 27 place count 245 transition count 780
Iterating global reduction 2 with 16 rules applied. Total rules applied 43 place count 245 transition count 780
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 43 place count 245 transition count 778
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 243 transition count 778
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 235 transition count 764
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 235 transition count 764
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 89 place count 222 transition count 751
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 222 transition count 750
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 95 place count 217 transition count 733
Iterating global reduction 3 with 5 rules applied. Total rules applied 100 place count 217 transition count 733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 217 transition count 732
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 109 place count 213 transition count 734
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 213 transition count 732
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 113 place count 211 transition count 732
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 115 place count 211 transition count 730
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 118 place count 211 transition count 730
Applied a total of 118 rules in 82 ms. Remains 211 /267 variables (removed 56) and now considering 730/802 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 211/267 places, 730/802 transitions.
RANDOM walk for 4000000 steps (85891 resets) in 36959 ms. (108 steps per ms) remains 34/40 properties
BEST_FIRST walk for 400004 steps (1830 resets) in 1163 ms. (343 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1798 resets) in 1062 ms. (376 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (1810 resets) in 1054 ms. (379 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1814 resets) in 1487 ms. (268 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1822 resets) in 1169 ms. (341 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (1780 resets) in 1081 ms. (369 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1798 resets) in 871 ms. (458 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1813 resets) in 817 ms. (489 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1786 resets) in 919 ms. (434 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1794 resets) in 1616 ms. (247 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1812 resets) in 1109 ms. (360 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1838 resets) in 1238 ms. (322 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1814 resets) in 1240 ms. (322 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1788 resets) in 1244 ms. (321 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1798 resets) in 1221 ms. (327 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1800 resets) in 1359 ms. (294 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1820 resets) in 1392 ms. (287 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1785 resets) in 1585 ms. (252 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1792 resets) in 1517 ms. (263 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1773 resets) in 1204 ms. (331 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1840 resets) in 681 ms. (586 steps per ms) remains 32/34 properties
BEST_FIRST walk for 400004 steps (1804 resets) in 665 ms. (600 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (1814 resets) in 740 ms. (539 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (1821 resets) in 1524 ms. (262 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1821 resets) in 1121 ms. (356 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400002 steps (1806 resets) in 1153 ms. (346 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (1828 resets) in 1096 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (1807 resets) in 912 ms. (438 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (1786 resets) in 1055 ms. (378 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (1836 resets) in 1071 ms. (373 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (1814 resets) in 1022 ms. (391 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (1859 resets) in 1011 ms. (395 steps per ms) remains 31/31 properties
[2024-06-02 18:50:16] [INFO ] Flow matrix only has 721 transitions (discarded 9 similar events)
// Phase 1: matrix 721 rows 211 cols
[2024-06-02 18:50:16] [INFO ] Computed 10 invariants in 9 ms
[2024-06-02 18:50:16] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 92/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 73/196 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 721/917 variables, 196/206 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/917 variables, 94/300 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/917 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 15/932 variables, 15/315 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/932 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/932 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 932/932 variables, and 315 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1390 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 211/211 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 92/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 73/196 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-02 18:50:18] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-06-02 18:50:18] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:50:18] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:50:18] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 721/917 variables, 196/210 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/917 variables, 94/304 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/917 variables, 31/335 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-02 18:50:19] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/917 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/917 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 15/932 variables, 15/351 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-02 18:50:20] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/932 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Invariant property smplace_595 does not hold.
Invariant property smplace_592 does not hold.
Invariant property smplace_591 does not hold.
At refinement iteration 15 (OVERLAPS) 0/932 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 932/932 variables, and 352 constraints, problems are : Problem set: 0 solved, 31 unsolved in 4759 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 211/211 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 6/6 constraints]
After SMT, in 6176ms problems are : Problem set: 0 solved, 31 unsolved
SDD proceeding with computation,222 properties remain. new max is 131072
SDD size :1.62608e+09 after 1.70943e+09
Parikh walk visited 0 properties in 1145 ms.
Support contains 31 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 730/730 transitions.
Graph (complete) has 1148 edges and 211 vertex of which 210 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 210 transition count 729
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 209 transition count 729
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 207 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 206 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 206 transition count 726
Applied a total of 9 rules in 20 ms. Remains 206 /211 variables (removed 5) and now considering 726/730 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 206/211 places, 726/730 transitions.
RANDOM walk for 4000000 steps (85736 resets) in 37011 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (1837 resets) in 985 ms. (405 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (1819 resets) in 799 ms. (500 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (1823 resets) in 1104 ms. (361 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (1793 resets) in 867 ms. (460 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (1841 resets) in 789 ms. (506 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (1825 resets) in 1052 ms. (379 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (1813 resets) in 780 ms. (512 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (1802 resets) in 1116 ms. (358 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (1771 resets) in 756 ms. (528 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (1800 resets) in 1098 ms. (363 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (1807 resets) in 665 ms. (600 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1817 resets) in 1099 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1823 resets) in 764 ms. (522 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1782 resets) in 1162 ms. (343 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1838 resets) in 690 ms. (578 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1802 resets) in 784 ms. (509 steps per ms) remains 30/30 properties
Invariant property smplace_590 does not hold.
Invariant property smplace_589 does not hold.
Invariant property smplace_588 does not hold.
Invariant property smplace_587 does not hold.
Invariant property smplace_581 does not hold.
Invariant property smplace_580 does not hold.
Invariant property smplace_579 does not hold.
Invariant property smplace_578 does not hold.
Invariant property smplace_577 does not hold.
Invariant property smplace_576 does not hold.
Invariant property smplace_575 does not hold.
Invariant property smplace_574 does not hold.
Invariant property smplace_573 does not hold.
Invariant property smplace_572 does not hold.
Invariant property smplace_571 does not hold.
Invariant property smplace_557 does not hold.
Invariant property smplace_556 does not hold.
Invariant property smplace_555 does not hold.
Invariant property smplace_554 does not hold.
Invariant property smplace_553 does not hold.
Invariant property smplace_552 does not hold.
Invariant property smplace_551 does not hold.
Invariant property smplace_550 does not hold.
Invariant property smplace_549 does not hold.
Invariant property smplace_548 does not hold.
Invariant property smplace_547 does not hold.
Invariant property smplace_546 does not hold.
Invariant property smplace_545 does not hold.
Invariant property smplace_544 does not hold.
Invariant property smplace_543 does not hold.
Invariant property smplace_542 does not hold.
Invariant property smplace_541 does not hold.
Invariant property smplace_540 does not hold.
Invariant property smplace_539 does not hold.
Invariant property smplace_538 does not hold.
BEST_FIRST walk for 400003 steps (1811 resets) in 1075 ms. (371 steps per ms) remains 30/30 properties
Invariant property smplace_489 does not hold.
Invariant property smplace_488 does not hold.
Invariant property smplace_487 does not hold.
Invariant property smplace_486 does not hold.
Invariant property smplace_485 does not hold.
Invariant property smplace_484 does not hold.
Invariant property smplace_483 does not hold.
Invariant property smplace_482 does not hold.
Invariant property smplace_481 does not hold.
BEST_FIRST walk for 400003 steps (1807 resets) in 1095 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1767 resets) in 726 ms. (550 steps per ms) remains 30/30 properties
SDD proceeding with computation,178 properties remain. new max is 131072
SDD size :1.70943e+09 after 2.61934e+09
BEST_FIRST walk for 400003 steps (1843 resets) in 777 ms. (514 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1802 resets) in 1110 ms. (360 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1807 resets) in 878 ms. (455 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1823 resets) in 767 ms. (520 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1804 resets) in 1056 ms. (378 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1861 resets) in 896 ms. (445 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1804 resets) in 1059 ms. (377 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1802 resets) in 960 ms. (416 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1815 resets) in 800 ms. (499 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1822 resets) in 1064 ms. (375 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1770 resets) in 813 ms. (491 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1778 resets) in 1024 ms. (390 steps per ms) remains 30/30 properties
SDD proceeding with computation,178 properties remain. new max is 262144
SDD size :2.61934e+09 after 4.03562e+09
Interrupted probabilistic random walk after 6593373 steps, run timeout after 66001 ms. (steps per millisecond=99 ) properties seen :2 out of 30
Probabilistic random walk after 6593373 steps, saw 1907077 distinct states, run finished after 66007 ms. (steps per millisecond=99 ) properties seen :2
[2024-06-02 18:51:52] [INFO ] Flow matrix only has 717 transitions (discarded 9 similar events)
// Phase 1: matrix 717 rows 206 cols
[2024-06-02 18:51:52] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:51:52] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 91/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 70/189 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 717/906 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 94/293 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/906 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 17/923 variables, 17/310 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/923 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/923 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 310 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 91/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 70/189 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 18:51:53] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:51:53] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 1 ms to minimize.
[2024-06-02 18:51:53] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-06-02 18:51:53] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 1 ms to minimize.
[2024-06-02 18:51:54] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 717/906 variables, 189/204 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/906 variables, 94/298 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/906 variables, 28/326 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/906 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 17/923 variables, 17/343 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 18:51:55] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/923 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/923 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/923 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 923/923 variables, and 344 constraints, problems are : Problem set: 0 solved, 28 unsolved in 3499 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 6/6 constraints]
After SMT, in 4784ms problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 3142 ms.
Support contains 28 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 726/726 transitions.
Graph (complete) has 1139 edges and 206 vertex of which 204 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 202 transition count 724
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 202 transition count 724
Applied a total of 5 rules in 25 ms. Remains 202 /206 variables (removed 4) and now considering 724/726 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 202/206 places, 724/726 transitions.
RANDOM walk for 4000000 steps (85969 resets) in 27076 ms. (147 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1794 resets) in 762 ms. (524 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1780 resets) in 1132 ms. (353 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1829 resets) in 1136 ms. (351 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (1787 resets) in 1047 ms. (381 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1807 resets) in 797 ms. (501 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1828 resets) in 1024 ms. (390 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1805 resets) in 832 ms. (480 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1828 resets) in 765 ms. (522 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1777 resets) in 931 ms. (429 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1811 resets) in 763 ms. (523 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1843 resets) in 1078 ms. (370 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1826 resets) in 898 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1820 resets) in 697 ms. (573 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1800 resets) in 698 ms. (572 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1821 resets) in 871 ms. (458 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (1795 resets) in 1039 ms. (384 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1835 resets) in 763 ms. (523 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1814 resets) in 976 ms. (409 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1797 resets) in 625 ms. (638 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (1804 resets) in 736 ms. (542 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1790 resets) in 639 ms. (625 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1798 resets) in 936 ms. (426 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1830 resets) in 1079 ms. (370 steps per ms) remains 28/28 properties
SDD proceeding with computation,178 properties remain. new max is 524288
SDD size :4.03562e+09 after 4.20094e+09
BEST_FIRST walk for 400003 steps (1804 resets) in 1066 ms. (374 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1825 resets) in 823 ms. (485 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1761 resets) in 776 ms. (514 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (1819 resets) in 993 ms. (402 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (1798 resets) in 962 ms. (415 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 6984131 steps, run timeout after 51001 ms. (steps per millisecond=136 ) properties seen :12 out of 28
Probabilistic random walk after 6984131 steps, saw 2001010 distinct states, run finished after 51001 ms. (steps per millisecond=136 ) properties seen :12
[2024-06-02 18:53:08] [INFO ] Flow matrix only has 715 transitions (discarded 9 similar events)
// Phase 1: matrix 715 rows 202 cols
[2024-06-02 18:53:08] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:53:08] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 42/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 131/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 715/904 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 94/293 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 13/917 variables, 13/306 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/917 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/917 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 917/917 variables, and 306 constraints, problems are : Problem set: 0 solved, 16 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 42/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 131/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:53:09] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 715/904 variables, 189/200 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 94/294 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/904 variables, 16/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:53:09] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/904 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/904 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 13/917 variables, 13/324 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/917 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/917 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 917/917 variables, and 324 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1717 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints]
After SMT, in 2473ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 1267 ms.
Support contains 16 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 724/724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 202 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 201 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 199 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 197 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 197 transition count 719
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 196 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 195 transition count 710
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 195 transition count 710
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 194 transition count 708
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 194 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 193 transition count 701
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 193 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 192 transition count 699
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 192 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 191 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 191 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 190 transition count 690
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 190 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 189 transition count 683
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 189 transition count 683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 188 transition count 681
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 188 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 187 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 187 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 186 transition count 672
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 186 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 185 transition count 668
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 185 transition count 668
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 184 transition count 666
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 184 transition count 666
Applied a total of 36 rules in 66 ms. Remains 184 /202 variables (removed 18) and now considering 666/724 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 184/202 places, 666/724 transitions.
RANDOM walk for 4000000 steps (85788 resets) in 23756 ms. (168 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1807 resets) in 669 ms. (597 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1776 resets) in 960 ms. (416 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1807 resets) in 790 ms. (505 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1807 resets) in 676 ms. (590 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1773 resets) in 960 ms. (416 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1804 resets) in 762 ms. (524 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1820 resets) in 966 ms. (413 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1806 resets) in 780 ms. (512 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1820 resets) in 681 ms. (586 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1822 resets) in 1002 ms. (398 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1824 resets) in 833 ms. (479 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1807 resets) in 878 ms. (455 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400001 steps (1796 resets) in 714 ms. (559 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1809 resets) in 973 ms. (410 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1803 resets) in 793 ms. (503 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1803 resets) in 645 ms. (619 steps per ms) remains 16/16 properties
SDD proceeding with computation,178 properties remain. new max is 1048576
SDD size :4.20094e+09 after 7.25682e+09
Interrupted probabilistic random walk after 3827897 steps, run timeout after 36001 ms. (steps per millisecond=106 ) properties seen :0 out of 16
Probabilistic random walk after 3827897 steps, saw 1099430 distinct states, run finished after 36001 ms. (steps per millisecond=106 ) properties seen :0
[2024-06-02 18:54:00] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 18:54:00] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:54:00] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 42/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 113/171 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 657/828 variables, 171/181 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 89/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 13/841 variables, 13/283 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 16 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 42/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 113/171 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:54:00] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:54:00] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 657/828 variables, 171/183 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 89/272 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 16/288 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:54:01] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:54:01] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 1 ms to minimize.
[2024-06-02 18:54:01] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 13/841 variables, 13/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/841 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/841 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 304 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1873 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
After SMT, in 2531ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 968 ms.
Support contains 16 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 666/666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 184/184 places, 666/666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Applied a total of 0 rules in 7 ms. Remains 184 /184 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2024-06-02 18:54:03] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
[2024-06-02 18:54:03] [INFO ] Invariant cache hit.
[2024-06-02 18:54:03] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 18:54:03] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
[2024-06-02 18:54:03] [INFO ] Invariant cache hit.
[2024-06-02 18:54:03] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-02 18:54:04] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-06-02 18:54:04] [INFO ] Redundant transitions in 34 ms returned []
Running 658 sub problems to find dead transitions.
[2024-06-02 18:54:04] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
[2024-06-02 18:54:04] [INFO ] Invariant cache hit.
[2024-06-02 18:54:04] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-02 18:54:10] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:54:10] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-06-02 18:54:11] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2024-06-02 18:54:11] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:54:12] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2024-06-02 18:54:12] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:54:12] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:54:13] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 1 ms to minimize.
[2024-06-02 18:54:13] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 4 (OVERLAPS) 657/840 variables, 183/207 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 89/296 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 7 (OVERLAPS) 1/841 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 841/841 variables, and 297 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 4 (OVERLAPS) 657/840 variables, 183/207 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 89/296 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 650/946 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/841 variables, and 946 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 650/658 constraints, Known Traps: 14/14 constraints]
After SMT, in 61125ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 61133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61679 ms. Remains : 184/184 places, 666/666 transitions.
RANDOM walk for 400000 steps (8610 resets) in 3938 ms. (101 steps per ms) remains 16/16 properties
Running SMT prover for 16 properties.
[2024-06-02 18:55:06] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
[2024-06-02 18:55:06] [INFO ] Invariant cache hit.
[2024-06-02 18:55:06] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:55:06] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2024-06-02 18:55:06] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-02 18:55:06] [INFO ] After 86ms SMT Verify possible using 89 Read/Feed constraints in real domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-02 18:55:07] [INFO ] After 591ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 18:55:07] [INFO ] After 775ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 18:55:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:55:07] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-02 18:55:07] [INFO ] After 118ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-02 18:55:07] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:55:07] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 1 ms to minimize.
[2024-06-02 18:55:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
TRAPS : Iteration 1
[2024-06-02 18:55:08] [INFO ] After 1250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-06-02 18:55:08] [INFO ] After 1485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
RANDOM walk for 4000000 steps (85973 resets) in 41050 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400001 steps (1792 resets) in 1392 ms. (287 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1827 resets) in 1160 ms. (344 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1780 resets) in 1211 ms. (330 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1793 resets) in 1152 ms. (346 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1820 resets) in 1372 ms. (291 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1797 resets) in 1203 ms. (332 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1827 resets) in 1011 ms. (395 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1852 resets) in 1051 ms. (380 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1765 resets) in 1048 ms. (381 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1821 resets) in 1120 ms. (356 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400001 steps (1817 resets) in 1269 ms. (314 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1796 resets) in 1179 ms. (338 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1811 resets) in 1187 ms. (336 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1796 resets) in 1175 ms. (340 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1773 resets) in 1373 ms. (291 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1815 resets) in 1169 ms. (341 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 4304208 steps, run timeout after 57001 ms. (steps per millisecond=75 ) properties seen :0 out of 16
Probabilistic random walk after 4304208 steps, saw 1221570 distinct states, run finished after 57001 ms. (steps per millisecond=75 ) properties seen :0
[2024-06-02 18:56:25] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
[2024-06-02 18:56:25] [INFO ] Invariant cache hit.
[2024-06-02 18:56:25] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 42/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 113/171 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 657/828 variables, 171/181 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 89/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 13/841 variables, 13/283 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 16 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 42/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 113/171 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:56:26] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-06-02 18:56:26] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2024-06-02 18:56:26] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 657/828 variables, 171/184 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 89/273 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 16/289 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:56:27] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2024-06-02 18:56:27] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 13/841 variables, 13/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/841 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/841 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 304 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1996 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
After SMT, in 2664ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 1849 ms.
Support contains 16 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 666/666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 184/184 places, 666/666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2024-06-02 18:56:30] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
[2024-06-02 18:56:30] [INFO ] Invariant cache hit.
[2024-06-02 18:56:30] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:56:30] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
[2024-06-02 18:56:30] [INFO ] Invariant cache hit.
[2024-06-02 18:56:30] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-02 18:56:30] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-06-02 18:56:30] [INFO ] Redundant transitions in 6 ms returned []
Running 658 sub problems to find dead transitions.
[2024-06-02 18:56:30] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
[2024-06-02 18:56:30] [INFO ] Invariant cache hit.
[2024-06-02 18:56:30] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-02 18:56:35] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:56:35] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 18:56:36] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2024-06-02 18:56:36] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-06-02 18:56:36] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:56:36] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-06-02 18:56:36] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 18:56:37] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2024-06-02 18:56:37] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:56:38] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 1 ms to minimize.
[2024-06-02 18:56:38] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:56:38] [INFO ] Deduced a trap composed of 99 places in 83 ms of which 1 ms to minimize.
[2024-06-02 18:56:39] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:56:39] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 4 (OVERLAPS) 657/840 variables, 183/207 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 89/296 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 7 (OVERLAPS) 1/841 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 841/841 variables, and 297 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 4 (OVERLAPS) 657/840 variables, 183/207 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 89/296 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 650/946 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Invariant property smplace_586 does not hold.
Invariant property smplace_585 does not hold.
Invariant property smplace_583 does not hold.
Invariant property smplace_570 does not hold.
Invariant property smplace_568 does not hold.
Invariant property smplace_567 does not hold.
Invariant property smplace_565 does not hold.
Invariant property smplace_563 does not hold.
Invariant property smplace_561 does not hold.
Invariant property smplace_537 does not hold.
Invariant property smplace_536 does not hold.
Invariant property smplace_535 does not hold.
Invariant property smplace_534 does not hold.
Invariant property smplace_497 does not hold.
Invariant property smplace_345 does not hold.
Invariant property smplace_344 does not hold.
Invariant property smplace_343 does not hold.
Invariant property smplace_342 does not hold.
Invariant property smplace_341 does not hold.
Invariant property smplace_340 does not hold.
Invariant property smplace_339 does not hold.
Invariant property smplace_338 does not hold.
Invariant property smplace_337 does not hold.
Invariant property smplace_336 does not hold.
Invariant property smplace_335 does not hold.
Invariant property smplace_334 does not hold.
Invariant property smplace_333 does not hold.
Invariant property smplace_332 does not hold.
Invariant property smplace_331 does not hold.
Invariant property smplace_330 does not hold.
Invariant property smplace_329 does not hold.
Invariant property smplace_311 does not hold.
Invariant property smplace_310 does not hold.
Invariant property smplace_308 does not hold.
Invariant property smplace_307 does not hold.
Invariant property smplace_306 does not hold.
Invariant property smplace_305 does not hold.
Invariant property smplace_304 does not hold.
Invariant property smplace_303 does not hold.
Invariant property smplace_302 does not hold.
Invariant property smplace_278 does not hold.
Invariant property smplace_277 does not hold.
Invariant property smplace_276 does not hold.
Invariant property smplace_275 does not hold.
Invariant property smplace_274 does not hold.
Invariant property smplace_273 does not hold.
Invariant property smplace_272 does not hold.
Invariant property smplace_269 does not hold.
SDD proceeding with computation,130 properties remain. new max is 1048576
SDD size :7.25682e+09 after 1.87586e+11
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/841 variables, and 946 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 650/658 constraints, Known Traps: 14/14 constraints]
After SMT, in 61103ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 61109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61626 ms. Remains : 184/184 places, 666/666 transitions.
RANDOM walk for 400000 steps (8584 resets) in 4486 ms. (89 steps per ms) remains 16/16 properties
Running SMT prover for 16 properties.
[2024-06-02 18:57:33] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
[2024-06-02 18:57:33] [INFO ] Invariant cache hit.
[2024-06-02 18:57:33] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 18:57:33] [INFO ] After 132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2024-06-02 18:57:33] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-02 18:57:33] [INFO ] After 77ms SMT Verify possible using 89 Read/Feed constraints in real domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-02 18:57:34] [INFO ] After 569ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 18:57:34] [INFO ] After 754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 18:57:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:57:34] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-02 18:57:34] [INFO ] After 116ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-02 18:57:34] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:57:34] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:57:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
TRAPS : Iteration 1
[2024-06-02 18:57:35] [INFO ] After 1133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-06-02 18:57:35] [INFO ] After 1359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
RANDOM walk for 40000 steps (858 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (180 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 926014 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 1
Probabilistic random walk after 926014 steps, saw 260118 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
[2024-06-02 18:57:38] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
[2024-06-02 18:57:38] [INFO ] Invariant cache hit.
[2024-06-02 18:57:38] [INFO ] State equation strengthened by 89 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/25 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 165/193 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 644/837 variables, 175/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/837 variables, 89/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/837 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/841 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/25 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 165/193 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:57:38] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:57:38] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 644/837 variables, 175/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/837 variables, 89/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:57:39] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/837 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/837 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/841 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 691ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 182 transition count 664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 181 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 181 transition count 663
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 180 transition count 668
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 179 transition count 654
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 179 transition count 654
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 178 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 178 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 177 transition count 645
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 177 transition count 645
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 176 transition count 643
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 176 transition count 643
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 175 transition count 636
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 175 transition count 636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 174 transition count 634
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 174 transition count 634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 173 transition count 627
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 173 transition count 627
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 172 transition count 625
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 172 transition count 625
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 171 transition count 618
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 171 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 170 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 170 transition count 616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 169 transition count 612
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 169 transition count 612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 168 transition count 610
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 168 transition count 610
Applied a total of 32 rules in 54 ms. Remains 168 /184 variables (removed 16) and now considering 610/666 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 168/184 places, 610/666 transitions.
RANDOM walk for 40000 steps (856 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (177 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1138710 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :0 out of 1
Probabilistic random walk after 1138710 steps, saw 277558 distinct states, run finished after 3001 ms. (steps per millisecond=379 ) properties seen :0
[2024-06-02 18:57:42] [INFO ] Flow matrix only has 601 transitions (discarded 9 similar events)
// Phase 1: matrix 601 rows 168 cols
[2024-06-02 18:57:42] [INFO ] Computed 10 invariants in 17 ms
[2024-06-02 18:57:42] [INFO ] State equation strengthened by 84 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 149/176 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 589/765 variables, 159/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/765 variables, 84/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/765 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/769 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/769 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/769 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 84/84 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/176 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:57:42] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 589/765 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
At refinement iteration 13 (INCLUDED_ONLY) 0/765 variables, 84/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/765 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/769 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/769 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/769 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 769/769 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 490ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 610/610 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 610/610 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 168/168 places, 610/610 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 610/610 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 610/610 (removed 0) transitions.
[2024-06-02 18:57:42] [INFO ] Flow matrix only has 601 transitions (discarded 9 similar events)
[2024-06-02 18:57:42] [INFO ] Invariant cache hit.
[2024-06-02 18:57:42] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:57:42] [INFO ] Flow matrix only has 601 transitions (discarded 9 similar events)
[2024-06-02 18:57:42] [INFO ] Invariant cache hit.
[2024-06-02 18:57:42] [INFO ] Flatten gal took : 54 ms
[2024-06-02 18:57:43] [INFO ] Applying decomposition
[2024-06-02 18:57:43] [INFO ] Flatten gal took : 41 ms
[2024-06-02 18:57:43] [INFO ] State equation strengthened by 84 read => feed constraints.
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/graph14047163579045856875.txt' '-o' '/tmp/graph14047163579045856875.bin' '-w' '/tmp/graph14047163579045856875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14047163579045856875.bin' '-l' '-1' '-v' '-w' '/tmp/graph14047163579045856875.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:57:43] [INFO ] Decomposing Gal with order
[2024-06-02 18:57:43] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-06-02 18:57:43] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 18:57:43] [INFO ] Rewriting arrays to variables to allow decomposition.
Running 602 sub problems to find dead transitions.
[2024-06-02 18:57:43] [INFO ] Flow matrix only has 601 transitions (discarded 9 similar events)
[2024-06-02 18:57:43] [INFO ] Invariant cache hit.
[2024-06-02 18:57:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-02 18:57:43] [INFO ] Removed a total of 982 redundant transitions.
[2024-06-02 18:57:43] [INFO ] Flatten gal took : 124 ms
[2024-06-02 18:57:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 26 ms.
[2024-06-02 18:57:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17425071390800596702.gal : 11 ms
[2024-06-02 18:57:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15348378113938682834.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/ReachabilityCardinality17425071390800596702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15348378113938682834.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 ...309
Loading property file /tmp/ReachabilityCardinality15348378113938682834.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :1 after 3214
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :3214 after 138854
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :138854 after 1.51839e+07
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1.51839e+07 after 9.03689e+07
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :9.03689e+07 after 1.23427e+11
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-06-02 18:57:47] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
[2024-06-02 18:57:47] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 13 ms to minimize.
[2024-06-02 18:57:47] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:57:47] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:57:47] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:57:48] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-06-02 18:57:48] [INFO ] Deduced a trap composed of 120 places in 85 ms of which 1 ms to minimize.
[2024-06-02 18:57:49] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2024-06-02 18:57:49] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:57:50] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:57:50] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 1 ms to minimize.
[2024-06-02 18:57:50] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2024-06-02 18:57:51] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (OVERLAPS) 601/768 variables, 167/190 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 84/274 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 7 (OVERLAPS) 1/769 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 275 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (OVERLAPS) 601/768 variables, 167/190 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 84/274 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 594/868 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 602 unsolved
SMT process timed out in 60871ms, After SMT, problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61305 ms. Remains : 168/168 places, 610/610 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 168 vertex of which 31 / 168 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 139 transition count 444
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 139 transition count 444
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 139 transition count 435
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 138 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 138 transition count 405
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 138 transition count 402
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 135 transition count 401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 135 transition count 400
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 134 transition count 400
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 133 transition count 399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 132 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 132 transition count 396
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 131 transition count 395
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 130 transition count 361
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 130 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 94 place count 130 transition count 339
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 130 transition count 334
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 106 place count 125 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 115 place count 125 transition count 323
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 118 place count 125 transition count 320
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 122 transition count 319
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 128 place count 122 transition count 319
Applied a total of 128 rules in 60 ms. Remains 122 /168 variables (removed 46) and now considering 319/610 (removed 291) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:58:44] [INFO ] Flow matrix only has 315 transitions (discarded 4 similar events)
// Phase 1: matrix 315 rows 122 cols
[2024-06-02 18:58:44] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:58:44] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:58:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:58:44] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:58:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-02 18:58:44] [INFO ] After 31ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:58:44] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:58:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
TRAPS : Iteration 1
[2024-06-02 18:58:44] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:58:44] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 337 ms.
RANDOM walk for 40000 steps (857 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (188 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :1.23427e+11 after 3.38119e+12
Interrupted probabilistic random walk after 964235 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :0 out of 1
Probabilistic random walk after 964235 steps, saw 270642 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
[2024-06-02 18:58:47] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 18:58:47] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 18:58:47] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:58:47] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:58:47] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 510ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 182 transition count 665
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 181 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 180 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 180 transition count 663
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 180 transition count 663
Applied a total of 8 rules in 18 ms. Remains 180 /184 variables (removed 4) and now considering 663/666 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 180/184 places, 663/666 transitions.
RANDOM walk for 40000 steps (857 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (180 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 966207 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :0 out of 1
Probabilistic random walk after 966207 steps, saw 271178 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
[2024-06-02 18:58:51] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 180 cols
[2024-06-02 18:58:51] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 18:58:51] [INFO ] State equation strengthened by 89 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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/822 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 89/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/834 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/834 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/834 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 89/89 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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:58:51] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:58:51] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-06-02 18:58:51] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 654/822 variables, 168/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 89/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/822 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/834 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/834 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/834 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 834/834 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 718ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 663/663 transitions.
Applied a total of 0 rules in 7 ms. Remains 180 /180 variables (removed 0) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 180/180 places, 663/663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 663/663 transitions.
Applied a total of 0 rules in 7 ms. Remains 180 /180 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2024-06-02 18:58:51] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2024-06-02 18:58:51] [INFO ] Invariant cache hit.
[2024-06-02 18:58:52] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 18:58:52] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2024-06-02 18:58:52] [INFO ] Invariant cache hit.
[2024-06-02 18:58:52] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-02 18:58:52] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-06-02 18:58:52] [INFO ] Redundant transitions in 9 ms returned []
Running 655 sub problems to find dead transitions.
[2024-06-02 18:58:52] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2024-06-02 18:58:52] [INFO ] Invariant cache hit.
[2024-06-02 18:58:52] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 18:58:57] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:58:57] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 1 ms to minimize.
[2024-06-02 18:58:57] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-06-02 18:58:57] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:58:58] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2024-06-02 18:58:58] [INFO ] Deduced a trap composed of 121 places in 92 ms of which 1 ms to minimize.
[2024-06-02 18:58:58] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 1 ms to minimize.
[2024-06-02 18:58:59] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:58:59] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2024-06-02 18:58:59] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-06-02 18:59:00] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
[2024-06-02 18:59:00] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-06-02 18:59:01] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 18:59:02] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (OVERLAPS) 654/834 variables, 180/204 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 89/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/834 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 8 (OVERLAPS) 0/834 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 293 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (OVERLAPS) 654/834 variables, 180/204 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 89/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 655/948 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 834/834 variables, and 948 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 14/14 constraints]
After SMT, in 61116ms problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 61122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61657 ms. Remains : 180/180 places, 663/663 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 180 vertex of which 31 / 180 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 151 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 151 transition count 497
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 151 transition count 488
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 150 transition count 487
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 150 transition count 458
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 150 transition count 455
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 147 transition count 454
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 147 transition count 453
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 146 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 145 transition count 452
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 144 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 69 place count 144 transition count 449
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 143 transition count 448
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 142 transition count 408
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 142 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 100 place count 142 transition count 381
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 142 transition count 376
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 112 place count 137 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 121 place count 137 transition count 365
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 137 transition count 362
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 128 place count 134 transition count 361
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 133 place count 134 transition count 361
Applied a total of 133 rules in 84 ms. Remains 134 /180 variables (removed 46) and now considering 361/663 (removed 302) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:59:53] [INFO ] Flow matrix only has 357 transitions (discarded 4 similar events)
// Phase 1: matrix 357 rows 134 cols
[2024-06-02 18:59:53] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:59:53] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:59:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:59:53] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:59:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 18:59:53] [INFO ] After 17ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:59:53] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:59:53] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 330 ms.
RANDOM walk for 40000 steps (889 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (181 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 940015 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 940015 steps, saw 263460 distinct states, run finished after 3002 ms. (steps per millisecond=313 ) properties seen :0
[2024-06-02 18:59:56] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 18:59:56] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 18:59:56] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:59:57] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:59:57] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/827 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/841 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 669
Applied a total of 7 rules in 14 ms. Remains 180 /184 variables (removed 4) and now considering 669/666 (removed -3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 180/184 places, 669/666 transitions.
RANDOM walk for 40000 steps (864 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (178 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 936385 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 1
Probabilistic random walk after 936385 steps, saw 262636 distinct states, run finished after 3002 ms. (steps per millisecond=311 ) properties seen :0
[2024-06-02 19:00:00] [INFO ] Flow matrix only has 660 transitions (discarded 9 similar events)
// Phase 1: matrix 660 rows 180 cols
[2024-06-02 19:00:00] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 19:00:00] [INFO ] State equation strengthened by 90 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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 660/828 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 90/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/840 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 90/90 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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 660/828 variables, 168/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 90/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/840 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/840 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 669/669 transitions.
Applied a total of 0 rules in 7 ms. Remains 180 /180 variables (removed 0) and now considering 669/669 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 180/180 places, 669/669 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 669/669 transitions.
Applied a total of 0 rules in 6 ms. Remains 180 /180 variables (removed 0) and now considering 669/669 (removed 0) transitions.
[2024-06-02 19:00:01] [INFO ] Flow matrix only has 660 transitions (discarded 9 similar events)
[2024-06-02 19:00:01] [INFO ] Invariant cache hit.
[2024-06-02 19:00:01] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 19:00:01] [INFO ] Flow matrix only has 660 transitions (discarded 9 similar events)
[2024-06-02 19:00:01] [INFO ] Invariant cache hit.
[2024-06-02 19:00:01] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-02 19:00:02] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-06-02 19:00:02] [INFO ] Redundant transitions in 7 ms returned []
Running 661 sub problems to find dead transitions.
[2024-06-02 19:00:02] [INFO ] Flow matrix only has 660 transitions (discarded 9 similar events)
[2024-06-02 19:00:02] [INFO ] Invariant cache hit.
[2024-06-02 19:00:02] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-02 19:00:07] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:00:07] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 4 ms to minimize.
[2024-06-02 19:00:07] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2024-06-02 19:00:07] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:00:07] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-06-02 19:00:07] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:00:08] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 1 ms to minimize.
[2024-06-02 19:00:09] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-06-02 19:00:09] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 1 ms to minimize.
[2024-06-02 19:00:10] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-02 19:00:11] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 5 (OVERLAPS) 660/840 variables, 180/201 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 90/291 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 291 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (OVERLAPS) 660/840 variables, 180/201 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 90/291 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 661/952 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 952 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 11/11 constraints]
After SMT, in 61002ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 61009ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61528 ms. Remains : 180/180 places, 669/669 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 114 edges and 180 vertex of which 31 / 180 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 151 transition count 503
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 151 transition count 503
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 151 transition count 494
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 150 transition count 493
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 150 transition count 464
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 150 transition count 461
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 147 transition count 460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 147 transition count 459
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 146 transition count 459
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 145 transition count 458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 144 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 75 place count 144 transition count 455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 143 transition count 454
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 142 transition count 413
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 142 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 107 place count 142 transition count 385
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 142 transition count 380
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 119 place count 137 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 128 place count 137 transition count 369
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 137 transition count 366
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 135 place count 134 transition count 365
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 142 place count 134 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 134 transition count 364
Applied a total of 143 rules in 70 ms. Remains 134 /180 variables (removed 46) and now considering 364/669 (removed 305) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:01:03] [INFO ] Flow matrix only has 360 transitions (discarded 4 similar events)
// Phase 1: matrix 360 rows 134 cols
[2024-06-02 19:01:03] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:01:03] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:01:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:03] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:01:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:01:03] [INFO ] After 23ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:01:03] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:01:03] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 249 ms.
RANDOM walk for 40000 steps (873 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (177 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 933644 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :0 out of 1
Probabilistic random walk after 933644 steps, saw 262062 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
[2024-06-02 19:01:06] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:01:06] [INFO ] Computed 10 invariants in 14 ms
[2024-06-02 19:01:06] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:01:06] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:01:06] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:01:07] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/827 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/841 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 654ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Applied a total of 7 rules in 12 ms. Remains 180 /184 variables (removed 4) and now considering 663/666 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 180/184 places, 663/666 transitions.
RANDOM walk for 40000 steps (858 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (174 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 950625 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :0 out of 1
Probabilistic random walk after 950625 steps, saw 266563 distinct states, run finished after 3002 ms. (steps per millisecond=316 ) properties seen :0
[2024-06-02 19:01:10] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 180 cols
[2024-06-02 19:01:10] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:01:10] [INFO ] State equation strengthened by 89 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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/822 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 89/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/834 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/834 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/834 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 89/89 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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:01:10] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:01:10] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:01:10] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 654/822 variables, 168/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 89/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/822 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:01:10] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/834 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/834 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/834 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 834/834 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 759ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 663/663 transitions.
Applied a total of 0 rules in 6 ms. Remains 180 /180 variables (removed 0) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 180/180 places, 663/663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 663/663 transitions.
Applied a total of 0 rules in 6 ms. Remains 180 /180 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2024-06-02 19:01:11] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2024-06-02 19:01:11] [INFO ] Invariant cache hit.
[2024-06-02 19:01:11] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 19:01:11] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2024-06-02 19:01:11] [INFO ] Invariant cache hit.
[2024-06-02 19:01:11] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-02 19:01:11] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-06-02 19:01:11] [INFO ] Redundant transitions in 7 ms returned []
Running 655 sub problems to find dead transitions.
[2024-06-02 19:01:11] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2024-06-02 19:01:11] [INFO ] Invariant cache hit.
[2024-06-02 19:01:11] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 19:01:16] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:01:16] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:01:16] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:01:16] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:01:17] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:01:17] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:01:17] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:01:17] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:01:19] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:01:19] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:01:19] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:01:20] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (OVERLAPS) 654/834 variables, 180/204 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 89/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 7 (OVERLAPS) 0/834 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 293 constraints, problems are : Problem set: 0 solved, 655 unsolved in 27852 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (OVERLAPS) 654/834 variables, 180/204 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 89/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 655/948 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 834/834 variables, and 948 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 14/14 constraints]
After SMT, in 58849ms problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 58855ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59333 ms. Remains : 180/180 places, 663/663 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 114 edges and 180 vertex of which 31 / 180 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 151 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 151 transition count 497
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 151 transition count 488
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 150 transition count 487
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 150 transition count 458
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 150 transition count 455
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 147 transition count 454
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 147 transition count 453
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 146 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 145 transition count 452
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 144 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 69 place count 144 transition count 449
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 143 transition count 448
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 142 transition count 408
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 142 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 100 place count 142 transition count 381
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 142 transition count 376
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 112 place count 137 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 121 place count 137 transition count 365
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 137 transition count 362
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 128 place count 134 transition count 361
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 134 place count 134 transition count 361
Applied a total of 134 rules in 62 ms. Remains 134 /180 variables (removed 46) and now considering 361/663 (removed 302) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:02:10] [INFO ] Flow matrix only has 357 transitions (discarded 4 similar events)
// Phase 1: matrix 357 rows 134 cols
[2024-06-02 19:02:10] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:02:10] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:02:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:02:10] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:02:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:02:10] [INFO ] After 32ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:02:10] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:02:10] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 274 ms.
RANDOM walk for 40000 steps (856 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (177 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 936898 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 1
Probabilistic random walk after 936898 steps, saw 262732 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
[2024-06-02 19:02:13] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:02:13] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 19:02:13] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:02:14] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:02:14] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Applied a total of 9 rules in 13 ms. Remains 179 /184 variables (removed 5) and now considering 662/666 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 179/184 places, 662/666 transitions.
RANDOM walk for 40000 steps (868 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (186 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 948114 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :0 out of 1
Probabilistic random walk after 948114 steps, saw 265843 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
[2024-06-02 19:02:17] [INFO ] Flow matrix only has 653 transitions (discarded 9 similar events)
// Phase 1: matrix 653 rows 179 cols
[2024-06-02 19:02:17] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:02:17] [INFO ] State equation strengthened by 89 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) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 653/820 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 89/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/820 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/832 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/832 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 832/832 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 89/89 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) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:02:17] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:02:17] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2024-06-02 19:02:17] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 653/820 variables, 167/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/820 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/832 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/832 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/832 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 832/832 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 672ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 662/662 transitions.
Applied a total of 0 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 179/179 places, 662/662 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 662/662 transitions.
Applied a total of 0 rules in 8 ms. Remains 179 /179 variables (removed 0) and now considering 662/662 (removed 0) transitions.
[2024-06-02 19:02:18] [INFO ] Flow matrix only has 653 transitions (discarded 9 similar events)
[2024-06-02 19:02:18] [INFO ] Invariant cache hit.
[2024-06-02 19:02:18] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 19:02:18] [INFO ] Flow matrix only has 653 transitions (discarded 9 similar events)
[2024-06-02 19:02:18] [INFO ] Invariant cache hit.
[2024-06-02 19:02:18] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-02 19:02:18] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-06-02 19:02:18] [INFO ] Redundant transitions in 8 ms returned []
Running 654 sub problems to find dead transitions.
[2024-06-02 19:02:18] [INFO ] Flow matrix only has 653 transitions (discarded 9 similar events)
[2024-06-02 19:02:18] [INFO ] Invariant cache hit.
[2024-06-02 19:02:18] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-06-02 19:02:23] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:02:23] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:02:23] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:02:23] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:02:24] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:02:24] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:02:24] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:02:24] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:02:25] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-06-02 19:02:25] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:02:25] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:02:26] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2024-06-02 19:02:26] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 4 (OVERLAPS) 653/832 variables, 179/202 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 89/291 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 7 (OVERLAPS) 0/832 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 654 unsolved
No progress, stopping.
After SMT solving in domain Real declared 832/832 variables, and 291 constraints, problems are : Problem set: 0 solved, 654 unsolved in 28317 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 654/654 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 654 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 4 (OVERLAPS) 653/832 variables, 179/202 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 89/291 constraints. Problems are: Problem set: 0 solved, 654 unsolved
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :3.38119e+12 after 1.45041e+13
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 654/945 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/832 variables, and 945 constraints, problems are : Problem set: 0 solved, 654 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 654/654 constraints, Known Traps: 13/13 constraints]
After SMT, in 59320ms problems are : Problem set: 0 solved, 654 unsolved
Search for dead transitions found 0 dead transitions in 59327ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59829 ms. Remains : 179/179 places, 662/662 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 179 vertex of which 31 / 179 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 496
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 150 transition count 487
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 149 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 48 place count 149 transition count 456
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 149 transition count 453
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 55 place count 146 transition count 452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 146 transition count 451
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 145 transition count 451
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 144 transition count 450
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 143 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 70 place count 143 transition count 447
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 142 transition count 446
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 141 transition count 406
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 141 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 101 place count 141 transition count 379
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 106 place count 141 transition count 374
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 113 place count 136 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 122 place count 136 transition count 363
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 125 place count 136 transition count 360
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 129 place count 133 transition count 359
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 135 place count 133 transition count 359
Applied a total of 135 rules in 48 ms. Remains 133 /179 variables (removed 46) and now considering 359/662 (removed 303) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:03:17] [INFO ] Flow matrix only has 355 transitions (discarded 4 similar events)
// Phase 1: matrix 355 rows 133 cols
[2024-06-02 19:03:17] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:03:18] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:03:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:03:18] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:03:18] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:03:18] [INFO ] After 22ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:03:18] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:03:18] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 226 ms.
RANDOM walk for 40000 steps (857 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (173 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 905879 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 905879 steps, saw 254809 distinct states, run finished after 3002 ms. (steps per millisecond=301 ) properties seen :0
[2024-06-02 19:03:21] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:03:21] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:03:21] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:03:21] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:03:21] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-06-02 19:03:21] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 623ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Applied a total of 11 rules in 18 ms. Remains 178 /184 variables (removed 6) and now considering 667/666 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 178/184 places, 667/666 transitions.
RANDOM walk for 40000 steps (872 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (169 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 933207 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :0 out of 1
Probabilistic random walk after 933207 steps, saw 261963 distinct states, run finished after 3002 ms. (steps per millisecond=310 ) properties seen :0
[2024-06-02 19:03:24] [INFO ] Flow matrix only has 658 transitions (discarded 9 similar events)
// Phase 1: matrix 658 rows 178 cols
[2024-06-02 19:03:25] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 19:03:25] [INFO ] State equation strengthened by 90 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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 658/824 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 90/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/836 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/836 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/836 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 90/90 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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:03:25] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:03:25] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 658/824 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 90/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/836 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/836 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/836 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 667/667 transitions.
Applied a total of 0 rules in 7 ms. Remains 178 /178 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 178/178 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 667/667 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2024-06-02 19:03:25] [INFO ] Flow matrix only has 658 transitions (discarded 9 similar events)
[2024-06-02 19:03:25] [INFO ] Invariant cache hit.
[2024-06-02 19:03:25] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 19:03:25] [INFO ] Flow matrix only has 658 transitions (discarded 9 similar events)
[2024-06-02 19:03:25] [INFO ] Invariant cache hit.
[2024-06-02 19:03:25] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-02 19:03:25] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-06-02 19:03:26] [INFO ] Redundant transitions in 7 ms returned []
Running 659 sub problems to find dead transitions.
[2024-06-02 19:03:26] [INFO ] Flow matrix only has 658 transitions (discarded 9 similar events)
[2024-06-02 19:03:26] [INFO ] Invariant cache hit.
[2024-06-02 19:03:26] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-02 19:03:31] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:03:31] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 1 ms to minimize.
[2024-06-02 19:03:31] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:03:31] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:03:31] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2024-06-02 19:03:31] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:03:31] [INFO ] Deduced a trap composed of 121 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:03:31] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:03:32] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2024-06-02 19:03:32] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:03:33] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:03:33] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:03:33] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-06-02 19:03:35] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-02 19:03:35] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 1 ms to minimize.
[2024-06-02 19:03:38] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (OVERLAPS) 658/836 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 90/294 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/836 variables, and 294 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 4 (OVERLAPS) 658/836 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 90/294 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 659/953 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/836 variables, and 953 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 16/16 constraints]
After SMT, in 61066ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 61072ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61554 ms. Remains : 178/178 places, 667/667 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 178 vertex of which 31 / 178 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 149 transition count 501
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 149 transition count 501
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 149 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 148 transition count 491
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 1 with 36 rules applied. Total rules applied 54 place count 148 transition count 455
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 148 transition count 452
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 61 place count 145 transition count 451
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 61 place count 145 transition count 450
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 144 transition count 450
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 143 transition count 449
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 142 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 82 place count 142 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 141 transition count 445
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 140 transition count 405
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 140 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 113 place count 140 transition count 378
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 140 transition count 373
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 125 place count 135 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 134 place count 135 transition count 362
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 135 transition count 359
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 141 place count 132 transition count 358
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 147 place count 132 transition count 358
Applied a total of 147 rules in 75 ms. Remains 132 /178 variables (removed 46) and now considering 358/667 (removed 309) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:04:27] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
// Phase 1: matrix 354 rows 132 cols
[2024-06-02 19:04:27] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:04:27] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:04:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:04:27] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:04:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:04:27] [INFO ] After 18ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:04:27] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:04:27] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 251 ms.
RANDOM walk for 40000 steps (877 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (187 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 956093 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :0 out of 1
Probabilistic random walk after 956093 steps, saw 268339 distinct states, run finished after 3002 ms. (steps per millisecond=318 ) properties seen :0
[2024-06-02 19:04:30] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:04:30] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:04:30] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:04:30] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:04:30] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 551ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 177 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 177 transition count 653
Applied a total of 13 rules in 20 ms. Remains 177 /184 variables (removed 7) and now considering 653/666 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 177/184 places, 653/666 transitions.
RANDOM walk for 40000 steps (857 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (177 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 977288 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 1
Probabilistic random walk after 977288 steps, saw 273733 distinct states, run finished after 3002 ms. (steps per millisecond=325 ) properties seen :0
[2024-06-02 19:04:34] [INFO ] Flow matrix only has 644 transitions (discarded 9 similar events)
// Phase 1: matrix 644 rows 177 cols
[2024-06-02 19:04:34] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:04:34] [INFO ] State equation strengthened by 88 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 644/809 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 88/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/821 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/821 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 88/88 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:04:34] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:04:34] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 644/809 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 88/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/809 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/809 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/821 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/821 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/821 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 821/821 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 517ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 177 /177 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 177/177 places, 653/653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 653/653 transitions.
Applied a total of 0 rules in 6 ms. Remains 177 /177 variables (removed 0) and now considering 653/653 (removed 0) transitions.
[2024-06-02 19:04:34] [INFO ] Flow matrix only has 644 transitions (discarded 9 similar events)
[2024-06-02 19:04:34] [INFO ] Invariant cache hit.
[2024-06-02 19:04:34] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 19:04:34] [INFO ] Flow matrix only has 644 transitions (discarded 9 similar events)
[2024-06-02 19:04:34] [INFO ] Invariant cache hit.
[2024-06-02 19:04:34] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 19:04:35] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-06-02 19:04:35] [INFO ] Redundant transitions in 7 ms returned []
Running 645 sub problems to find dead transitions.
[2024-06-02 19:04:35] [INFO ] Flow matrix only has 644 transitions (discarded 9 similar events)
[2024-06-02 19:04:35] [INFO ] Invariant cache hit.
[2024-06-02 19:04:35] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 645 unsolved
[2024-06-02 19:04:39] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 121 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 131 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:04:41] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:04:41] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:04:42] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:04:42] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:04:42] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:04:43] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:04:43] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:04:44] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:04:44] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 4 (OVERLAPS) 644/821 variables, 177/204 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 88/292 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 7 (OVERLAPS) 0/821 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 645 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 292 constraints, problems are : Problem set: 0 solved, 645 unsolved in 27358 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 645/645 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 645 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 4 (OVERLAPS) 644/821 variables, 177/204 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 88/292 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 645/937 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/821 variables, and 937 constraints, problems are : Problem set: 0 solved, 645 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 645/645 constraints, Known Traps: 17/17 constraints]
After SMT, in 58334ms problems are : Problem set: 0 solved, 645 unsolved
Search for dead transitions found 0 dead transitions in 58340ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58828 ms. Remains : 177/177 places, 653/653 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 177 vertex of which 31 / 177 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 148 transition count 487
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 148 transition count 487
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 148 transition count 478
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 147 transition count 477
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 147 transition count 448
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 147 transition count 445
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 144 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 144 transition count 443
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 143 transition count 443
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 142 transition count 442
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 141 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 141 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 140 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 139 transition count 399
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 139 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 98 place count 139 transition count 373
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 139 transition count 368
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 110 place count 134 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 119 place count 134 transition count 357
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 122 place count 134 transition count 354
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 126 place count 131 transition count 353
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 132 place count 131 transition count 353
Applied a total of 132 rules in 47 ms. Remains 131 /177 variables (removed 46) and now considering 353/653 (removed 300) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:05:33] [INFO ] Flow matrix only has 349 transitions (discarded 4 similar events)
// Phase 1: matrix 349 rows 131 cols
[2024-06-02 19:05:33] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:05:33] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:05:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:05:33] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:05:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:05:33] [INFO ] After 26ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:05:33] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:05:33] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 238 ms.
RANDOM walk for 40000 steps (863 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (176 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 975993 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 1
Probabilistic random walk after 975993 steps, saw 273391 distinct states, run finished after 3002 ms. (steps per millisecond=325 ) properties seen :0
[2024-06-02 19:05:36] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:05:36] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:05:36] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:05:37] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:05:37] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:05:37] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 690ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 177 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 177 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 176 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 176 transition count 651
Applied a total of 15 rules in 20 ms. Remains 176 /184 variables (removed 8) and now considering 651/666 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 176/184 places, 651/666 transitions.
RANDOM walk for 40000 steps (849 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (176 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1045572 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1045572 steps, saw 293493 distinct states, run finished after 3002 ms. (steps per millisecond=348 ) properties seen :0
[2024-06-02 19:05:40] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 176 cols
[2024-06-02 19:05:40] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:05:40] [INFO ] State equation strengthened by 88 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) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 642/806 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 88/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/818 variables, 12/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/818 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 88/88 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) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:05:40] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 642/806 variables, 164/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 88/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/818 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/818 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/818 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 476ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 651/651 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 651/651 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 176/176 places, 651/651 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 651/651 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2024-06-02 19:05:41] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-02 19:05:41] [INFO ] Invariant cache hit.
[2024-06-02 19:05:41] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 19:05:41] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-02 19:05:41] [INFO ] Invariant cache hit.
[2024-06-02 19:05:41] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 19:05:41] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-06-02 19:05:41] [INFO ] Redundant transitions in 4 ms returned []
Running 643 sub problems to find dead transitions.
[2024-06-02 19:05:41] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-02 19:05:41] [INFO ] Invariant cache hit.
[2024-06-02 19:05:41] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-06-02 19:05:46] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:05:46] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:05:46] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:05:46] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:05:46] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:05:46] [INFO ] Deduced a trap composed of 121 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:05:47] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:05:47] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2024-06-02 19:05:47] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:05:48] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:05:48] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:05:48] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:05:49] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 642/818 variables, 176/199 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 88/287 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 643 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 287 constraints, problems are : Problem set: 0 solved, 643 unsolved in 27125 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 642/818 variables, 176/199 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 88/287 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 643/930 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 930 constraints, problems are : Problem set: 0 solved, 643 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 13/13 constraints]
After SMT, in 58018ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 58025ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58553 ms. Remains : 176/176 places, 651/651 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 176 vertex of which 31 / 176 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 147 transition count 485
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 147 transition count 485
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 147 transition count 476
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 146 transition count 475
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 146 transition count 446
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 146 transition count 443
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 143 transition count 442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 143 transition count 441
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 142 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 141 transition count 440
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 140 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 140 transition count 437
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 139 transition count 436
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 138 transition count 397
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 138 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 98 place count 138 transition count 371
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 138 transition count 366
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 110 place count 133 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 119 place count 133 transition count 355
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 122 place count 133 transition count 352
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 126 place count 130 transition count 351
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 132 place count 130 transition count 351
Applied a total of 132 rules in 46 ms. Remains 130 /176 variables (removed 46) and now considering 351/651 (removed 300) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:06:39] [INFO ] Flow matrix only has 347 transitions (discarded 4 similar events)
// Phase 1: matrix 347 rows 130 cols
[2024-06-02 19:06:39] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:06:39] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:06:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:06:39] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:06:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:06:39] [INFO ] After 40ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:06:39] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:06:39] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 266 ms.
RANDOM walk for 40000 steps (862 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (163 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 992389 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :0 out of 1
Probabilistic random walk after 992389 steps, saw 277639 distinct states, run finished after 3002 ms. (steps per millisecond=330 ) properties seen :0
[2024-06-02 19:06:42] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:06:42] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 19:06:42] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:06:43] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 4 ms to minimize.
[2024-06-02 19:06:43] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 542ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 177 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 177 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 176 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 176 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 175 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 175 transition count 644
Applied a total of 17 rules in 26 ms. Remains 175 /184 variables (removed 9) and now considering 644/666 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 175/184 places, 644/666 transitions.
RANDOM walk for 40000 steps (873 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (190 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1013161 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 1
Probabilistic random walk after 1013161 steps, saw 283623 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
[2024-06-02 19:06:46] [INFO ] Flow matrix only has 635 transitions (discarded 9 similar events)
// Phase 1: matrix 635 rows 175 cols
[2024-06-02 19:06:46] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:06:46] [INFO ] State equation strengthened by 87 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 635/798 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 87/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/810 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/810 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 87/87 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:06:46] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:06:47] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:06:47] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:06:47] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 635/798 variables, 163/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 87/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/810 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/810 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/810 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 794ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 644/644 transitions.
Applied a total of 0 rules in 5 ms. Remains 175 /175 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 175/175 places, 644/644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 644/644 transitions.
Applied a total of 0 rules in 6 ms. Remains 175 /175 variables (removed 0) and now considering 644/644 (removed 0) transitions.
[2024-06-02 19:06:47] [INFO ] Flow matrix only has 635 transitions (discarded 9 similar events)
[2024-06-02 19:06:47] [INFO ] Invariant cache hit.
[2024-06-02 19:06:47] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 19:06:47] [INFO ] Flow matrix only has 635 transitions (discarded 9 similar events)
[2024-06-02 19:06:47] [INFO ] Invariant cache hit.
[2024-06-02 19:06:47] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 19:06:47] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-06-02 19:06:47] [INFO ] Redundant transitions in 4 ms returned []
Running 636 sub problems to find dead transitions.
[2024-06-02 19:06:47] [INFO ] Flow matrix only has 635 transitions (discarded 9 similar events)
[2024-06-02 19:06:47] [INFO ] Invariant cache hit.
[2024-06-02 19:06:47] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 636 unsolved
[2024-06-02 19:06:52] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:06:52] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:06:52] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-06-02 19:06:52] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:06:53] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:06:53] [INFO ] Deduced a trap composed of 121 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:06:53] [INFO ] Deduced a trap composed of 129 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:06:53] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:06:54] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:06:54] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:06:55] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:06:55] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:06:55] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:06:55] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 0 ms to minimize.
[2024-06-02 19:06:56] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:06:56] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:06:56] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 4 (OVERLAPS) 635/810 variables, 175/202 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 87/289 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 7 (OVERLAPS) 0/810 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 636 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 289 constraints, problems are : Problem set: 0 solved, 636 unsolved in 26240 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 4 (OVERLAPS) 635/810 variables, 175/202 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 87/289 constraints. Problems are: Problem set: 0 solved, 636 unsolved
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :1.45041e+13 after 2.59719e+13
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 636/925 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/810 variables, and 925 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 17/17 constraints]
After SMT, in 57187ms problems are : Problem set: 0 solved, 636 unsolved
Search for dead transitions found 0 dead transitions in 57192ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57714 ms. Remains : 175/175 places, 644/644 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 175 vertex of which 31 / 175 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 146 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 146 transition count 478
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 146 transition count 469
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 145 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 145 transition count 439
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 145 transition count 436
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 142 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 142 transition count 434
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 141 transition count 434
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 140 transition count 433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 139 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 139 transition count 430
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 138 transition count 429
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 137 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 137 transition count 391
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 97 place count 137 transition count 366
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 137 transition count 361
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 109 place count 132 transition count 359
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 118 place count 132 transition count 350
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 132 transition count 347
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 125 place count 129 transition count 346
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 131 place count 129 transition count 346
Applied a total of 131 rules in 57 ms. Remains 129 /175 variables (removed 46) and now considering 346/644 (removed 298) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:07:45] [INFO ] Flow matrix only has 342 transitions (discarded 4 similar events)
// Phase 1: matrix 342 rows 129 cols
[2024-06-02 19:07:45] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:07:45] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:07:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:07:45] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:07:45] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:07:45] [INFO ] After 23ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:07:45] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:07:45] [INFO ] After 156ms 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 (878 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (176 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1035600 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1035600 steps, saw 290682 distinct states, run finished after 3002 ms. (steps per millisecond=344 ) properties seen :0
[2024-06-02 19:07:48] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:07:48] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:07:48] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:07:48] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:07:48] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2024-06-02 19:07:48] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 177 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 177 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 176 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 176 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 175 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 175 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 174 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 174 transition count 642
Applied a total of 19 rules in 23 ms. Remains 174 /184 variables (removed 10) and now considering 642/666 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 174/184 places, 642/666 transitions.
RANDOM walk for 40000 steps (868 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (180 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1062898 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 1
Probabilistic random walk after 1062898 steps, saw 297669 distinct states, run finished after 3002 ms. (steps per millisecond=354 ) properties seen :0
[2024-06-02 19:07:52] [INFO ] Flow matrix only has 633 transitions (discarded 9 similar events)
// Phase 1: matrix 633 rows 174 cols
[2024-06-02 19:07:52] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:07:52] [INFO ] State equation strengthened by 87 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) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/795 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 87/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/795 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/807 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/807 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/807 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 807/807 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 87/87 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) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:07:52] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:07:52] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/795 variables, 162/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/795 variables, 87/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/795 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/795 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/807 variables, 12/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/807 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/807 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 807/807 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 506ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 642/642 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 642/642 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 174/174 places, 642/642 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 642/642 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 642/642 (removed 0) transitions.
[2024-06-02 19:07:52] [INFO ] Flow matrix only has 633 transitions (discarded 9 similar events)
[2024-06-02 19:07:52] [INFO ] Invariant cache hit.
[2024-06-02 19:07:52] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 19:07:52] [INFO ] Flow matrix only has 633 transitions (discarded 9 similar events)
[2024-06-02 19:07:52] [INFO ] Invariant cache hit.
[2024-06-02 19:07:53] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 19:07:53] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-06-02 19:07:53] [INFO ] Redundant transitions in 4 ms returned []
Running 634 sub problems to find dead transitions.
[2024-06-02 19:07:53] [INFO ] Flow matrix only has 633 transitions (discarded 9 similar events)
[2024-06-02 19:07:53] [INFO ] Invariant cache hit.
[2024-06-02 19:07:53] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-06-02 19:07:58] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 1 ms to minimize.
[2024-06-02 19:07:58] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:07:58] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:07:58] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:07:58] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:07:58] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:07:58] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:07:59] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:08:00] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:08:00] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:08:00] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:08:01] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:08:01] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (OVERLAPS) 633/807 variables, 174/197 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 87/284 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 7 (OVERLAPS) 0/807 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 634 unsolved
No progress, stopping.
After SMT solving in domain Real declared 807/807 variables, and 284 constraints, problems are : Problem set: 0 solved, 634 unsolved in 26802 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (OVERLAPS) 633/807 variables, 174/197 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 87/284 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 634/918 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/807 variables, and 918 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 13/13 constraints]
After SMT, in 57747ms problems are : Problem set: 0 solved, 634 unsolved
Search for dead transitions found 0 dead transitions in 57753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58250 ms. Remains : 174/174 places, 642/642 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 174 vertex of which 31 / 174 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 145 transition count 476
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 145 transition count 476
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 145 transition count 467
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 144 transition count 466
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 144 transition count 437
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 144 transition count 434
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 141 transition count 433
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 141 transition count 432
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 140 transition count 432
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 139 transition count 431
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 138 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 138 transition count 428
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 137 transition count 427
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 136 transition count 389
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 136 transition count 389
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 97 place count 136 transition count 364
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 136 transition count 359
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 109 place count 131 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 118 place count 131 transition count 348
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 131 transition count 345
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 125 place count 128 transition count 344
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 131 place count 128 transition count 344
Applied a total of 131 rules in 42 ms. Remains 128 /174 variables (removed 46) and now considering 344/642 (removed 298) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:08:51] [INFO ] Flow matrix only has 340 transitions (discarded 4 similar events)
// Phase 1: matrix 340 rows 128 cols
[2024-06-02 19:08:51] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:08:51] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:08:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:08:51] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:08:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:08:51] [INFO ] After 21ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:08:51] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:08:51] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 228 ms.
RANDOM walk for 40000 steps (859 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1003359 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 1
Probabilistic random walk after 1003359 steps, saw 280833 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2024-06-02 19:08:54] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:08:54] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 19:08:54] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:08:54] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:08:54] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 177 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 177 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 176 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 176 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 175 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 175 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 174 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 174 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 173 transition count 635
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 173 transition count 635
Applied a total of 21 rules in 24 ms. Remains 173 /184 variables (removed 11) and now considering 635/666 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 173/184 places, 635/666 transitions.
RANDOM walk for 40000 steps (849 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (185 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1027730 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :0 out of 1
Probabilistic random walk after 1027730 steps, saw 288147 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
[2024-06-02 19:08:58] [INFO ] Flow matrix only has 626 transitions (discarded 9 similar events)
// Phase 1: matrix 626 rows 173 cols
[2024-06-02 19:08:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:08:58] [INFO ] State equation strengthened by 86 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 626/787 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/787 variables, 86/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/799 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/799 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/799 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 86/86 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:08:58] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:08:58] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 626/787 variables, 161/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 86/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/787 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/787 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/799 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/799 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/799 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 635/635 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 635/635 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 173/173 places, 635/635 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 635/635 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 635/635 (removed 0) transitions.
[2024-06-02 19:08:58] [INFO ] Flow matrix only has 626 transitions (discarded 9 similar events)
[2024-06-02 19:08:58] [INFO ] Invariant cache hit.
[2024-06-02 19:08:58] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 19:08:58] [INFO ] Flow matrix only has 626 transitions (discarded 9 similar events)
[2024-06-02 19:08:58] [INFO ] Invariant cache hit.
[2024-06-02 19:08:58] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-02 19:08:58] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-06-02 19:08:58] [INFO ] Redundant transitions in 10 ms returned []
Running 627 sub problems to find dead transitions.
[2024-06-02 19:08:58] [INFO ] Flow matrix only has 626 transitions (discarded 9 similar events)
[2024-06-02 19:08:58] [INFO ] Invariant cache hit.
[2024-06-02 19:08:58] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-06-02 19:09:03] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:09:03] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:09:03] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2024-06-02 19:09:03] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:09:03] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:09:03] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-06-02 19:09:04] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:09:04] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:09:04] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:09:05] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 1 ms to minimize.
[2024-06-02 19:09:05] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:09:05] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:09:06] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:09:07] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 4 (OVERLAPS) 626/799 variables, 173/197 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 86/283 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 7 (OVERLAPS) 0/799 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 627 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 283 constraints, problems are : Problem set: 0 solved, 627 unsolved in 25477 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-06-02 19:09:27] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 5 (OVERLAPS) 626/799 variables, 173/198 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 86/284 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/799 variables, 627/911 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/799 variables, and 911 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 15/15 constraints]
After SMT, in 56308ms problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 56313ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56777 ms. Remains : 173/173 places, 635/635 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 173 vertex of which 31 / 173 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 144 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 144 transition count 469
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 144 transition count 460
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 143 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 143 transition count 430
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 143 transition count 427
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 140 transition count 426
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 140 transition count 425
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 139 transition count 425
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 138 transition count 424
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 137 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 137 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 136 transition count 420
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 135 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 135 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 135 transition count 359
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 135 transition count 354
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 108 place count 130 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 117 place count 130 transition count 343
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 120 place count 130 transition count 340
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 124 place count 127 transition count 339
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 130 place count 127 transition count 339
Applied a total of 130 rules in 42 ms. Remains 127 /173 variables (removed 46) and now considering 339/635 (removed 296) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:09:55] [INFO ] Flow matrix only has 335 transitions (discarded 4 similar events)
// Phase 1: matrix 335 rows 127 cols
[2024-06-02 19:09:55] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:09:55] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:09:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:09:55] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:09:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:09:55] [INFO ] After 24ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:09:55] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:09:55] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 219 ms.
RANDOM walk for 40000 steps (873 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (184 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1004454 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 1
Probabilistic random walk after 1004454 steps, saw 281135 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2024-06-02 19:09:58] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:09:58] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:09:58] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:09:58] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:09:58] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:09:59] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 177 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 177 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 176 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 176 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 175 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 175 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 174 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 174 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 173 transition count 635
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 173 transition count 635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 172 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 172 transition count 633
Applied a total of 23 rules in 27 ms. Remains 172 /184 variables (removed 12) and now considering 633/666 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 172/184 places, 633/666 transitions.
RANDOM walk for 40000 steps (830 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (168 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1035787 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1035787 steps, saw 290756 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2024-06-02 19:10:02] [INFO ] Flow matrix only has 624 transitions (discarded 9 similar events)
// Phase 1: matrix 624 rows 172 cols
[2024-06-02 19:10:02] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:10:02] [INFO ] State equation strengthened by 86 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) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 624/784 variables, 160/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 86/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/796 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/796 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 796/796 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 86/86 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) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:10:02] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 624/784 variables, 160/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 86/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/796 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/796 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/796 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 796/796 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 633/633 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 633/633 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 172/172 places, 633/633 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 633/633 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 633/633 (removed 0) transitions.
[2024-06-02 19:10:02] [INFO ] Flow matrix only has 624 transitions (discarded 9 similar events)
[2024-06-02 19:10:02] [INFO ] Invariant cache hit.
[2024-06-02 19:10:02] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 19:10:02] [INFO ] Flow matrix only has 624 transitions (discarded 9 similar events)
[2024-06-02 19:10:02] [INFO ] Invariant cache hit.
[2024-06-02 19:10:03] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-02 19:10:03] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2024-06-02 19:10:03] [INFO ] Redundant transitions in 8 ms returned []
Running 625 sub problems to find dead transitions.
[2024-06-02 19:10:03] [INFO ] Flow matrix only has 624 transitions (discarded 9 similar events)
[2024-06-02 19:10:03] [INFO ] Invariant cache hit.
[2024-06-02 19:10:03] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-02 19:10:08] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:10:08] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:10:08] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:10:08] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:10:08] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:10:08] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:10:09] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:10:09] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:10:09] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:10:10] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:10:10] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:10:11] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:10:11] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:10:12] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:10:12] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:10:12] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:10:12] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:10:12] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (OVERLAPS) 624/796 variables, 172/200 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 86/286 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (OVERLAPS) 0/796 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 625 unsolved
No progress, stopping.
After SMT solving in domain Real declared 796/796 variables, and 286 constraints, problems are : Problem set: 0 solved, 625 unsolved in 27162 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (OVERLAPS) 624/796 variables, 172/200 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 86/286 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 625/911 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 911 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 18/18 constraints]
After SMT, in 58100ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 58108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58596 ms. Remains : 172/172 places, 633/633 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 172 vertex of which 31 / 172 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 143 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 143 transition count 467
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 143 transition count 458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 142 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 142 transition count 428
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 142 transition count 425
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 139 transition count 424
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 139 transition count 423
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 138 transition count 423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 137 transition count 422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 136 transition count 427
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 136 transition count 419
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 135 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 134 transition count 381
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 134 transition count 381
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 134 transition count 357
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 134 transition count 352
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 108 place count 129 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 117 place count 129 transition count 341
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 120 place count 129 transition count 338
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 124 place count 126 transition count 337
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 130 place count 126 transition count 337
Applied a total of 130 rules in 44 ms. Remains 126 /172 variables (removed 46) and now considering 337/633 (removed 296) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:11:01] [INFO ] Flow matrix only has 333 transitions (discarded 4 similar events)
// Phase 1: matrix 333 rows 126 cols
[2024-06-02 19:11:01] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:11:01] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:11:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:11:01] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:11:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:11:01] [INFO ] After 17ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:11:01] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:11:01] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 216 ms.
RANDOM walk for 40000 steps (861 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (179 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1012812 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 1
Probabilistic random walk after 1012812 steps, saw 283575 distinct states, run finished after 3002 ms. (steps per millisecond=337 ) properties seen :0
[2024-06-02 19:11:04] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:11:04] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:11:04] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:11:04] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:11:05] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 558ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 177 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 177 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 176 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 176 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 175 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 175 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 174 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 174 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 173 transition count 635
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 173 transition count 635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 172 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 172 transition count 633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 171 transition count 626
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 171 transition count 626
Applied a total of 25 rules in 33 ms. Remains 171 /184 variables (removed 13) and now considering 626/666 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 171/184 places, 626/666 transitions.
RANDOM walk for 40000 steps (830 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (180 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1030098 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 1
Probabilistic random walk after 1030098 steps, saw 288975 distinct states, run finished after 3002 ms. (steps per millisecond=343 ) properties seen :0
[2024-06-02 19:11:08] [INFO ] Flow matrix only has 617 transitions (discarded 9 similar events)
// Phase 1: matrix 617 rows 171 cols
[2024-06-02 19:11:08] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:11:08] [INFO ] State equation strengthened by 85 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, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 617/776 variables, 159/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 85/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/788 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/788 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/788 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 788/788 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 85/85 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, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:11:08] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 617/776 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 85/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/776 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/776 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/788 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/788 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/788 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 788/788 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 506ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 626/626 transitions.
Applied a total of 0 rules in 15 ms. Remains 171 /171 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 171/171 places, 626/626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 626/626 transitions.
Applied a total of 0 rules in 8 ms. Remains 171 /171 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2024-06-02 19:11:08] [INFO ] Flow matrix only has 617 transitions (discarded 9 similar events)
[2024-06-02 19:11:08] [INFO ] Invariant cache hit.
[2024-06-02 19:11:08] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 19:11:08] [INFO ] Flow matrix only has 617 transitions (discarded 9 similar events)
[2024-06-02 19:11:08] [INFO ] Invariant cache hit.
[2024-06-02 19:11:09] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-02 19:11:09] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-06-02 19:11:09] [INFO ] Redundant transitions in 5 ms returned []
Running 618 sub problems to find dead transitions.
[2024-06-02 19:11:09] [INFO ] Flow matrix only has 617 transitions (discarded 9 similar events)
[2024-06-02 19:11:09] [INFO ] Invariant cache hit.
[2024-06-02 19:11:09] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 618 unsolved
[2024-06-02 19:11:14] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:11:14] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:11:14] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:11:14] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:11:15] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:11:15] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:11:15] [INFO ] Deduced a trap composed of 125 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:11:15] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:11:15] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:11:16] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:11:17] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:11:17] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:11:17] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:11:18] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 618 unsolved
[2024-06-02 19:11:19] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (OVERLAPS) 617/788 variables, 171/196 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 85/281 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 8 (OVERLAPS) 0/788 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 618 unsolved
No progress, stopping.
After SMT solving in domain Real declared 788/788 variables, and 281 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 617/788 variables, 171/196 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/788 variables, 85/281 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 618/899 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/788 variables, and 899 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 15/15 constraints]
After SMT, in 60846ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60853ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61280 ms. Remains : 171/171 places, 626/626 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 171 vertex of which 31 / 171 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 142 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 142 transition count 460
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 142 transition count 451
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 141 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 141 transition count 421
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 141 transition count 418
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 138 transition count 417
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 138 transition count 416
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 137 transition count 416
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 136 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 135 transition count 420
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 135 transition count 412
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 134 transition count 411
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 133 transition count 375
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 133 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 95 place count 133 transition count 352
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 100 place count 133 transition count 347
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 107 place count 128 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 116 place count 128 transition count 336
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 128 transition count 333
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 123 place count 125 transition count 332
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 129 place count 125 transition count 332
Applied a total of 129 rules in 36 ms. Remains 125 /171 variables (removed 46) and now considering 332/626 (removed 294) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:12:10] [INFO ] Flow matrix only has 328 transitions (discarded 4 similar events)
// Phase 1: matrix 328 rows 125 cols
[2024-06-02 19:12:10] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:12:10] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:12:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:12:10] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:12:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:12:10] [INFO ] After 20ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:12:10] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:12:10] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 224 ms.
RANDOM walk for 40000 steps (839 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (171 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 998757 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :0 out of 1
Probabilistic random walk after 998757 steps, saw 279507 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
[2024-06-02 19:12:13] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:12:13] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:12:13] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:12:13] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:12:13] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
[2024-06-02 19:12:13] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 177 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 177 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 176 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 176 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 175 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 175 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 174 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 174 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 173 transition count 635
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 173 transition count 635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 172 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 172 transition count 633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 171 transition count 626
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 171 transition count 626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 170 transition count 624
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 170 transition count 624
Applied a total of 27 rules in 32 ms. Remains 170 /184 variables (removed 14) and now considering 624/666 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 170/184 places, 624/666 transitions.
RANDOM walk for 40000 steps (848 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (173 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1070003 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :0 out of 1
Probabilistic random walk after 1070003 steps, saw 299922 distinct states, run finished after 3002 ms. (steps per millisecond=356 ) properties seen :0
[2024-06-02 19:12:17] [INFO ] Flow matrix only has 615 transitions (discarded 9 similar events)
// Phase 1: matrix 615 rows 170 cols
[2024-06-02 19:12:17] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:12:17] [INFO ] State equation strengthened by 85 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) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/158 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 615/773 variables, 158/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 85/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/785 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/785 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/785 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 785/785 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 85/85 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) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/158 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:12:17] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:12:17] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 615/773 variables, 158/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 85/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/773 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/773 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/785 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/785 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/785 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 785/785 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 526ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 624/624 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 624/624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 170/170 places, 624/624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 624/624 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 624/624 (removed 0) transitions.
[2024-06-02 19:12:17] [INFO ] Flow matrix only has 615 transitions (discarded 9 similar events)
[2024-06-02 19:12:17] [INFO ] Invariant cache hit.
[2024-06-02 19:12:17] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 19:12:17] [INFO ] Flow matrix only has 615 transitions (discarded 9 similar events)
[2024-06-02 19:12:17] [INFO ] Invariant cache hit.
[2024-06-02 19:12:18] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-02 19:12:18] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2024-06-02 19:12:18] [INFO ] Redundant transitions in 7 ms returned []
Running 616 sub problems to find dead transitions.
[2024-06-02 19:12:18] [INFO ] Flow matrix only has 615 transitions (discarded 9 similar events)
[2024-06-02 19:12:18] [INFO ] Invariant cache hit.
[2024-06-02 19:12:18] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 19:12:22] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:12:22] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:12:22] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:12:22] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:12:23] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:12:23] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-06-02 19:12:23] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:12:23] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:12:24] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:12:24] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:12:24] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:12:25] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:12:26] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:12:26] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 615/785 variables, 170/194 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/785 variables, 85/279 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 19:12:43] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:12:43] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/785 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/785 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 785/785 variables, and 281 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 615/785 variables, 170/196 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/785 variables, 85/281 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 616/897 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/785 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 785/785 variables, and 897 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 16/16 constraints]
After SMT, in 60897ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60903ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61420 ms. Remains : 170/170 places, 624/624 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 170 vertex of which 31 / 170 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 141 transition count 458
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 141 transition count 458
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 141 transition count 449
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 140 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 140 transition count 419
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 140 transition count 416
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 137 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 137 transition count 414
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 136 transition count 414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 135 transition count 413
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 134 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 134 transition count 410
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 133 transition count 409
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 132 transition count 373
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 132 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 95 place count 132 transition count 350
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 100 place count 132 transition count 345
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 107 place count 127 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 116 place count 127 transition count 334
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 127 transition count 331
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 123 place count 124 transition count 330
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 129 place count 124 transition count 330
Applied a total of 129 rules in 36 ms. Remains 124 /170 variables (removed 46) and now considering 330/624 (removed 294) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:13:19] [INFO ] Flow matrix only has 326 transitions (discarded 4 similar events)
// Phase 1: matrix 326 rows 124 cols
[2024-06-02 19:13:19] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:13:19] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:13:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:13:19] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:13:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:13:19] [INFO ] After 25ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:13:19] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:13:19] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 214 ms.
RANDOM walk for 40000 steps (852 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (183 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1040821 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 1
Probabilistic random walk after 1040821 steps, saw 292226 distinct states, run finished after 3002 ms. (steps per millisecond=346 ) properties seen :0
[2024-06-02 19:13:22] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:13:22] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:13:22] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:13:22] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:13:22] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:13:22] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 177 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 177 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 176 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 176 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 175 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 175 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 174 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 174 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 173 transition count 635
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 173 transition count 635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 172 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 172 transition count 633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 171 transition count 626
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 171 transition count 626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 170 transition count 624
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 170 transition count 624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 169 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 169 transition count 617
Applied a total of 29 rules in 34 ms. Remains 169 /184 variables (removed 15) and now considering 617/666 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 169/184 places, 617/666 transitions.
RANDOM walk for 40000 steps (871 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (176 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1094604 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1094604 steps, saw 306149 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
[2024-06-02 19:13:26] [INFO ] Flow matrix only has 608 transitions (discarded 9 similar events)
// Phase 1: matrix 608 rows 169 cols
[2024-06-02 19:13:26] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:13:26] [INFO ] State equation strengthened by 84 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) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/157 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 608/765 variables, 157/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 84/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/777 variables, 12/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/777 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/777 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 84/84 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) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/157 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:13:26] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:13:26] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 608/765 variables, 157/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 84/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/765 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/777 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/777 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/777 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 777/777 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 518ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 617/617 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 617/617 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 169/169 places, 617/617 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 617/617 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 617/617 (removed 0) transitions.
[2024-06-02 19:13:26] [INFO ] Flow matrix only has 608 transitions (discarded 9 similar events)
[2024-06-02 19:13:26] [INFO ] Invariant cache hit.
[2024-06-02 19:13:26] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 19:13:26] [INFO ] Flow matrix only has 608 transitions (discarded 9 similar events)
[2024-06-02 19:13:26] [INFO ] Invariant cache hit.
[2024-06-02 19:13:26] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-02 19:13:27] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-06-02 19:13:27] [INFO ] Redundant transitions in 9 ms returned []
Running 609 sub problems to find dead transitions.
[2024-06-02 19:13:27] [INFO ] Flow matrix only has 608 transitions (discarded 9 similar events)
[2024-06-02 19:13:27] [INFO ] Invariant cache hit.
[2024-06-02 19:13:27] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 609 unsolved
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:13:33] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:13:33] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:13:34] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:13:34] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:13:35] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 4 (OVERLAPS) 608/777 variables, 169/192 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 84/276 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 7 (OVERLAPS) 0/777 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 609 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 276 constraints, problems are : Problem set: 0 solved, 609 unsolved in 26992 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 4 (OVERLAPS) 608/777 variables, 169/192 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 84/276 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 609/885 constraints. Problems are: Problem set: 0 solved, 609 unsolved
[2024-06-02 19:14:10] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/777 variables, and 886 constraints, problems are : Problem set: 0 solved, 609 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 14/14 constraints]
After SMT, in 57770ms problems are : Problem set: 0 solved, 609 unsolved
Search for dead transitions found 0 dead transitions in 57777ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58220 ms. Remains : 169/169 places, 617/617 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 169 vertex of which 31 / 169 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 140 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 140 transition count 451
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 140 transition count 442
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 139 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 139 transition count 412
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 139 transition count 409
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 136 transition count 408
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 136 transition count 407
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 135 transition count 407
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 134 transition count 406
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 133 transition count 411
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 133 transition count 403
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 132 transition count 402
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 131 transition count 367
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 131 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 94 place count 131 transition count 345
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 131 transition count 340
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 106 place count 126 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 115 place count 126 transition count 329
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 118 place count 126 transition count 326
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 123 transition count 325
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 128 place count 123 transition count 325
Applied a total of 128 rules in 39 ms. Remains 123 /169 variables (removed 46) and now considering 325/617 (removed 292) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:14:25] [INFO ] Flow matrix only has 321 transitions (discarded 4 similar events)
// Phase 1: matrix 321 rows 123 cols
[2024-06-02 19:14:25] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:14:25] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:14:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:14:25] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:14:25] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:14:25] [INFO ] After 14ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:14:25] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:14:25] [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 188 ms.
RANDOM walk for 40000 steps (893 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (195 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1005972 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 1
Probabilistic random walk after 1005972 steps, saw 281548 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
[2024-06-02 19:14:28] [INFO ] Flow matrix only has 657 transitions (discarded 9 similar events)
// Phase 1: matrix 657 rows 184 cols
[2024-06-02 19:14:28] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:14:28] [INFO ] State equation strengthened by 89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 657/827 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/841 variables, 14/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:14:28] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:14:28] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:14:28] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 657/827 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 89/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/841 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/841 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 666/666 transitions.
Graph (complete) has 1044 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 182 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 181 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 181 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 179 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 179 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 178 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 177 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 177 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 176 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 176 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 175 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 175 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 174 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 174 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 173 transition count 635
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 173 transition count 635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 172 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 172 transition count 633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 171 transition count 626
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 171 transition count 626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 170 transition count 624
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 170 transition count 624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 169 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 169 transition count 617
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 168 transition count 615
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 168 transition count 615
Applied a total of 31 rules in 33 ms. Remains 168 /184 variables (removed 16) and now considering 615/666 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 168/184 places, 615/666 transitions.
RANDOM walk for 40000 steps (872 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (178 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1055681 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 1
Probabilistic random walk after 1055681 steps, saw 295894 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
[2024-06-02 19:14:31] [INFO ] Flow matrix only has 606 transitions (discarded 9 similar events)
// Phase 1: matrix 606 rows 168 cols
[2024-06-02 19:14:31] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:14:31] [INFO ] State equation strengthened by 84 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 606/762 variables, 156/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 84/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/762 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/774 variables, 12/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 84/84 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:14:32] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:14:32] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 606/762 variables, 156/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/762 variables, 84/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/762 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/774 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/774 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/774 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 615/615 transitions.
Applied a total of 0 rules in 8 ms. Remains 168 /168 variables (removed 0) and now considering 615/615 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 168/168 places, 615/615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 615/615 transitions.
Applied a total of 0 rules in 5 ms. Remains 168 /168 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2024-06-02 19:14:32] [INFO ] Flow matrix only has 606 transitions (discarded 9 similar events)
[2024-06-02 19:14:32] [INFO ] Invariant cache hit.
[2024-06-02 19:14:32] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 19:14:32] [INFO ] Flow matrix only has 606 transitions (discarded 9 similar events)
[2024-06-02 19:14:32] [INFO ] Invariant cache hit.
[2024-06-02 19:14:32] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-02 19:14:32] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2024-06-02 19:14:32] [INFO ] Redundant transitions in 9 ms returned []
Running 607 sub problems to find dead transitions.
[2024-06-02 19:14:32] [INFO ] Flow matrix only has 606 transitions (discarded 9 similar events)
[2024-06-02 19:14:32] [INFO ] Invariant cache hit.
[2024-06-02 19:14:32] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-06-02 19:14:37] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:14:37] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:14:38] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:14:38] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:14:38] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:14:38] [INFO ] Deduced a trap composed of 121 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:14:38] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:14:38] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:14:39] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:14:39] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:14:40] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:14:40] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:14:41] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-06-02 19:14:42] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 5 (OVERLAPS) 606/774 variables, 168/192 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 84/276 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/774 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 8 (OVERLAPS) 0/774 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 607 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 276 constraints, problems are : Problem set: 0 solved, 607 unsolved in 29196 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 607 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 4 (OVERLAPS) 606/774 variables, 168/192 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 84/276 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 607/883 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/774 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/774 variables, and 883 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 14/14 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 607 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60527 ms. Remains : 168/168 places, 615/615 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 168 vertex of which 31 / 168 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 139 transition count 449
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 139 transition count 449
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 139 transition count 440
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 138 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 138 transition count 410
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 138 transition count 407
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 135 transition count 406
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 135 transition count 405
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 134 transition count 405
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 133 transition count 404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 132 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 132 transition count 401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 131 transition count 400
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 130 transition count 365
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 130 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 94 place count 130 transition count 343
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 130 transition count 338
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 106 place count 125 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 115 place count 125 transition count 327
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 118 place count 125 transition count 324
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 122 transition count 323
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 128 place count 122 transition count 323
Applied a total of 128 rules in 42 ms. Remains 122 /168 variables (removed 46) and now considering 323/615 (removed 292) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:15:33] [INFO ] Flow matrix only has 319 transitions (discarded 4 similar events)
// Phase 1: matrix 319 rows 122 cols
[2024-06-02 19:15:33] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:15:33] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:15:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:15:33] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:15:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:15:33] [INFO ] After 15ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:15:33] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:15:33] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 212 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 184 vertex of which 31 / 184 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 155 transition count 500
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 155 transition count 500
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 155 transition count 491
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 154 transition count 490
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 47 place count 154 transition count 461
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 154 transition count 458
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 151 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 151 transition count 456
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 150 transition count 456
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 149 transition count 455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 148 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 69 place count 148 transition count 452
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 147 transition count 451
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 146 transition count 411
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 146 transition count 411
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 100 place count 146 transition count 384
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 146 transition count 379
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 112 place count 141 transition count 377
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 121 place count 141 transition count 368
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 141 transition count 365
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 128 place count 138 transition count 364
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 133 place count 138 transition count 364
Applied a total of 133 rules in 48 ms. Remains 138 /184 variables (removed 46) and now considering 364/666 (removed 302) transitions.
Running SMT prover for 16 properties.
[2024-06-02 19:15:33] [INFO ] Flow matrix only has 360 transitions (discarded 4 similar events)
// Phase 1: matrix 360 rows 138 cols
[2024-06-02 19:15:33] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:15:33] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 19:15:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:15:33] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-02 19:15:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 19:15:33] [INFO ] After 169ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-02 19:15:33] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
TRAPS : Iteration 1
[2024-06-02 19:15:34] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
TRAPS : Iteration 2
[2024-06-02 19:15:34] [INFO ] After 1080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-06-02 19:15:34] [INFO ] After 1539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
[2024-06-02 19:15:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:15:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:15:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10097072536387092421.gal : 3 ms
[2024-06-02 19:15:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12322434841721343709.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/ReachabilityCardinality10097072536387092421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12322434841721343709.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/ReachabilityCardinality12322434841721343709.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :11 after 17
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :17 after 25
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :25 after 31
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :31 after 273
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :273 after 1025
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :1025 after 1407
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :1407 after 2267
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :2267 after 3353
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :3353 after 6341
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :6341 after 12142
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :12142 after 42003
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :42003 after 296387
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :296387 after 865390
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :865390 after 3.08234e+06
Detected timeout of ITS tools.
[2024-06-02 19:15:50] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:15:50] [INFO ] Applying decomposition
[2024-06-02 19:15:50] [INFO ] Flatten gal took : 12 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/graph9775796575025491069.txt' '-o' '/tmp/graph9775796575025491069.bin' '-w' '/tmp/graph9775796575025491069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9775796575025491069.bin' '-l' '-1' '-v' '-w' '/tmp/graph9775796575025491069.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:15:50] [INFO ] Decomposing Gal with order
[2024-06-02 19:15:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:15:50] [INFO ] Removed a total of 667 redundant transitions.
[2024-06-02 19:15:50] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:15:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 8 ms.
[2024-06-02 19:15:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality671734058294974419.gal : 3 ms
[2024-06-02 19:15:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2676252110356967019.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/ReachabilityCardinality671734058294974419.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2676252110356967019.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 ...306
Loading property file /tmp/ReachabilityCardinality2676252110356967019.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 37
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :37 after 29161
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :29161 after 533629
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :533629 after 8.08865e+08
Invariant property smplace_514 does not hold.
Invariant property smplace_513 does not hold.
Invariant property smplace_512 does not hold.
Invariant property smplace_511 does not hold.
Invariant property smplace_510 does not hold.
Invariant property smplace_509 does not hold.
Invariant property smplace_508 does not hold.
Invariant property smplace_507 does not hold.
Invariant property smplace_506 does not hold.
Invariant property smplace_505 does not hold.
Invariant property smplace_504 does not hold.
Invariant property smplace_503 does not hold.
Invariant property smplace_433 does not hold.
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :4.99606e+09 after 5.06424e+09
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\_mod\_flat,5.17727e+09,0.607465,30728,1334,138,52527,868,684,88979,105,4647,0
Total reachable state count : 5177266694

Verifying 16 reachability properties.
Invariant property smplace_433 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\_433,460624,0.609246,30992,395,92,52527,868,692,88979,109,4647,0
Invariant property smplace_500 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\_500,1.6638e+07,0.609738,30992,318,64,52527,868,696,88979,111,4647,0
Invariant property smplace_501 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\_501,24684,0.60992,30992,71,55,52527,868,698,88979,111,4647,0
Invariant property smplace_502 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\_502,1.6638e+07,0.61022,30992,319,64,52527,868,701,88979,111,4647,0
Invariant property smplace_503 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\_503,1.6638e+07,0.610511,30992,318,64,52527,868,707,88979,111,4647,0
Invariant property smplace_504 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\_504,1.46798e+07,0.610884,30992,449,72,52527,868,715,88979,114,4647,0
Invariant property smplace_505 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\_505,1.6638e+07,0.611173,30992,319,64,52527,868,719,88979,114,4647,0
Invariant property smplace_506 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\_506,1.46798e+07,0.611564,30992,450,72,52527,868,723,88979,114,4647,0
Invariant property smplace_507 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\_507,1.6638e+07,0.611875,30992,318,64,52527,868,727,88979,114,4647,0
Invariant property smplace_508 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\_508,1.46798e+07,0.612245,30992,450,72,52527,868,729,88979,114,4647,0
Invariant property smplace_509 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\_509,1.6638e+07,0.612523,30992,319,64,52527,868,731,88979,114,4647,0
Invariant property smplace_510 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\_510,1.46798e+07,0.612912,30992,450,72,52527,868,733,88979,114,4647,0
Invariant property smplace_511 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\_511,1.6638e+07,0.613197,30992,318,64,52527,868,735,88979,114,4647,0
Invariant property smplace_512 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\_512,1.46798e+07,0.613565,30992,450,72,52527,868,737,88979,114,4647,0
Invariant property smplace_513 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\_513,1.60592e+07,0.613916,30992,416,68,52527,868,739,88979,114,4647,0
Invariant property smplace_514 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\_514,1.46798e+07,0.614299,30992,450,72,52527,868,743,88979,114,4647,0
Over-approximation ignoring read arcs solved 0 properties in 17491 ms.
[2024-06-02 19:15:50] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:15:50] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:15:50] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3117880334330117812.gal : 3 ms
[2024-06-02 19:15:50] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12074197656964124621.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/ReachabilityFireability3117880334330117812.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12074197656964124621.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/ReachabilityFireability12074197656964124621.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :12 after 14
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :14 after 15
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :15 after 97
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :97 after 123
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :123 after 237
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :237 after 700
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :700 after 3024
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :3024 after 4914
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :4914 after 14009
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :14009 after 125768
Detected timeout of ITS tools.
[2024-06-02 19:15:53] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:15:53] [INFO ] Applying decomposition
[2024-06-02 19:15:53] [INFO ] Flatten gal took : 18 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/graph84237096910726768.txt' '-o' '/tmp/graph84237096910726768.bin' '-w' '/tmp/graph84237096910726768.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph84237096910726768.bin' '-l' '-1' '-v' '-w' '/tmp/graph84237096910726768.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:15:53] [INFO ] Decomposing Gal with order
[2024-06-02 19:15:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:15:53] [INFO ] Removed a total of 1172 redundant transitions.
[2024-06-02 19:15:53] [INFO ] Flatten gal took : 47 ms
[2024-06-02 19:15:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 12 ms.
[2024-06-02 19:15:53] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14298298990223796181.gal : 3 ms
[2024-06-02 19:15:53] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2372295548623929350.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/ReachabilityFireability14298298990223796181.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2372295548623929350.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/ReachabilityFireability2372295548623929350.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :9 after 129
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :129 after 129
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :129 after 129
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :129 after 3457
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :3457 after 25473
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :25473 after 224961
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :224961 after 467393
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :467393 after 5.27706e+06
Detected timeout of ITS tools.
[2024-06-02 19:15:57] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:15:57] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:15:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2094187638165160778.gal : 3 ms
[2024-06-02 19:15:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2302792529071445967.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/ReachabilityFireability2094187638165160778.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2302792529071445967.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/ReachabilityFireability2302792529071445967.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :12 after 14
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :14 after 15
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :15 after 97
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :97 after 123
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :123 after 237
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :237 after 700
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :700 after 3024
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :3024 after 4914
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :4914 after 14009
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :14009 after 125768
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :125768 after 303050
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :303050 after 620769
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :620769 after 1.92136e+06
Detected timeout of ITS tools.
[2024-06-02 19:16:27] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:16:27] [INFO ] Applying decomposition
[2024-06-02 19:16:27] [INFO ] Flatten gal took : 16 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/graph13437285433273352715.txt' '-o' '/tmp/graph13437285433273352715.bin' '-w' '/tmp/graph13437285433273352715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13437285433273352715.bin' '-l' '-1' '-v' '-w' '/tmp/graph13437285433273352715.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:16:27] [INFO ] Decomposing Gal with order
[2024-06-02 19:16:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:16:27] [INFO ] Removed a total of 1298 redundant transitions.
[2024-06-02 19:16:27] [INFO ] Flatten gal took : 30 ms
[2024-06-02 19:16:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 13 ms.
[2024-06-02 19:16:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16880472000936461249.gal : 4 ms
[2024-06-02 19:16:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14732747603532394201.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/ReachabilityFireability16880472000936461249.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14732747603532394201.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 ...309
Loading property file /tmp/ReachabilityFireability14732747603532394201.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :1 after 17
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :17 after 1281
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :1281 after 12033
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :12033 after 121345
Detected timeout of ITS tools.
[2024-06-02 19:16:57] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:16:57] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:16:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2525874180812695261.gal : 3 ms
[2024-06-02 19:16:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12731114292797454889.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/ReachabilityFireability2525874180812695261.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12731114292797454889.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/ReachabilityFireability12731114292797454889.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :12 after 14
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :14 after 15
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :15 after 97
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :97 after 123
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :123 after 237
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :237 after 700
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :700 after 3024
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :3024 after 4914
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :4914 after 14009
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :14009 after 125768
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :125768 after 303050
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :303050 after 620769
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :620769 after 1.92136e+06
SDD proceeding with computation,16 properties remain. new max is 131072
SDD size :1.92136e+06 after 3.16528e+06

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="FireWire-PT-20"
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 FireWire-PT-20, 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 r561-tall-171734906400203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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