fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r136-tall-171631132900555
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DoubleExponent-PT-010

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4826.871 3600000.00 5574618.00 7557.10 ?T??T?FFFTF??F?F normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716389825208

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 14:57:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 14:57:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 14:57:06] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-22 14:57:06] [INFO ] Transformed 534 places.
[2024-05-22 14:57:06] [INFO ] Transformed 498 transitions.
[2024-05-22 14:57:06] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-010-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 531 transition count 498
Applied a total of 3 rules in 81 ms. Remains 531 /534 variables (removed 3) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 531 cols
[2024-05-22 14:57:06] [INFO ] Computed 52 invariants in 100 ms
[2024-05-22 14:57:07] [INFO ] Implicit Places using invariants in 481 ms returned [437, 439]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 511 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/534 places, 498/498 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 528 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 528 transition count 497
Applied a total of 2 rules in 69 ms. Remains 528 /529 variables (removed 1) and now considering 497/498 (removed 1) transitions.
// Phase 1: matrix 497 rows 528 cols
[2024-05-22 14:57:07] [INFO ] Computed 50 invariants in 30 ms
[2024-05-22 14:57:07] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-22 14:57:07] [INFO ] Invariant cache hit.
[2024-05-22 14:57:08] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 528/534 places, 497/498 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2153 ms. Remains : 528/534 places, 497/498 transitions.
Support contains 44 out of 528 places after structural reductions.
[2024-05-22 14:57:09] [INFO ] Flatten gal took : 60 ms
[2024-05-22 14:57:09] [INFO ] Flatten gal took : 34 ms
[2024-05-22 14:57:09] [INFO ] Input system was already deterministic with 497 transitions.
Support contains 43 out of 528 places (down from 44) after GAL structural reductions.
RANDOM walk for 40000 steps (1324 resets) in 2727 ms. (14 steps per ms) remains 24/28 properties
BEST_FIRST walk for 4002 steps (109 resets) in 77 ms. (51 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (109 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (113 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (107 resets) in 83 ms. (47 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (113 resets) in 58 ms. (67 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (109 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (106 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (106 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (113 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (114 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (113 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (110 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (114 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (108 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (111 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (114 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (108 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (111 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (112 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (105 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (114 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (112 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (107 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (114 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
[2024-05-22 14:57:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 360/397 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 5/402 variables, 1/6 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 125/527 variables, 43/49 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/49 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/528 variables, 1/50 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/50 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 497/1025 variables, 528/578 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1025 variables, 0/578 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/1025 variables, 0/578 constraints. Problems are: Problem set: 8 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 578 constraints, problems are : Problem set: 8 solved, 16 unsolved in 2374 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 368/397 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 5/402 variables, 1/6 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 125/527 variables, 43/49 constraints. Problems are: Problem set: 8 solved, 16 unsolved
[2024-05-22 14:57:13] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 36 ms to minimize.
[2024-05-22 14:57:13] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 9 ms to minimize.
[2024-05-22 14:57:14] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 4 ms to minimize.
[2024-05-22 14:57:14] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 4 ms to minimize.
[2024-05-22 14:57:14] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-05-22 14:57:14] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 3 ms to minimize.
[2024-05-22 14:57:14] [INFO ] Deduced a trap composed of 209 places in 162 ms of which 3 ms to minimize.
[2024-05-22 14:57:14] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 4 ms to minimize.
[2024-05-22 14:57:15] [INFO ] Deduced a trap composed of 232 places in 150 ms of which 3 ms to minimize.
[2024-05-22 14:57:15] [INFO ] Deduced a trap composed of 216 places in 149 ms of which 3 ms to minimize.
[2024-05-22 14:57:15] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 3 ms to minimize.
[2024-05-22 14:57:15] [INFO ] Deduced a trap composed of 198 places in 147 ms of which 3 ms to minimize.
[2024-05-22 14:57:15] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-05-22 14:57:15] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 3 ms to minimize.
[2024-05-22 14:57:16] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 3 ms to minimize.
[2024-05-22 14:57:16] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 3 ms to minimize.
[2024-05-22 14:57:16] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 3 ms to minimize.
[2024-05-22 14:57:16] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 4 ms to minimize.
[2024-05-22 14:57:16] [INFO ] Deduced a trap composed of 213 places in 134 ms of which 3 ms to minimize.
[2024-05-22 14:57:16] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 20/69 constraints. Problems are: Problem set: 8 solved, 16 unsolved
[2024-05-22 14:57:16] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 4 ms to minimize.
[2024-05-22 14:57:17] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 3 ms to minimize.
[2024-05-22 14:57:17] [INFO ] Deduced a trap composed of 195 places in 144 ms of which 3 ms to minimize.
[2024-05-22 14:57:17] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 3 ms to minimize.
[2024-05-22 14:57:17] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 3 ms to minimize.
[2024-05-22 14:57:17] [INFO ] Deduced a trap composed of 216 places in 145 ms of which 3 ms to minimize.
[2024-05-22 14:57:17] [INFO ] Deduced a trap composed of 180 places in 145 ms of which 3 ms to minimize.
SMT process timed out in 7495ms, After SMT, problems are : Problem set: 8 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 497/497 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 528 transition count 402
Reduce places removed 95 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 102 rules applied. Total rules applied 197 place count 433 transition count 395
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 204 place count 426 transition count 395
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 204 place count 426 transition count 373
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 248 place count 404 transition count 373
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 3 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 400 place count 328 transition count 297
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 432 place count 312 transition count 297
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 433 place count 312 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 434 place count 311 transition count 296
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 4 with 39 rules applied. Total rules applied 473 place count 311 transition count 257
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 512 place count 272 transition count 257
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 5 with 41 rules applied. Total rules applied 553 place count 272 transition count 257
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 554 place count 272 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 555 place count 271 transition count 256
Applied a total of 555 rules in 141 ms. Remains 271 /528 variables (removed 257) and now considering 256/497 (removed 241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 271/528 places, 256/497 transitions.
RANDOM walk for 40000 steps (5051 resets) in 475 ms. (84 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40000 steps (3380 resets) in 373 ms. (106 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3392 resets) in 218 ms. (182 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3328 resets) in 191 ms. (208 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3406 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3352 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3402 resets) in 154 ms. (258 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3391 resets) in 171 ms. (232 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3392 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3364 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3356 resets) in 145 ms. (273 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3402 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3400 resets) in 108 ms. (366 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3404 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
// Phase 1: matrix 256 rows 271 cols
[2024-05-22 14:57:19] [INFO ] Computed 50 invariants in 19 ms
[2024-05-22 14:57:19] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 208/233 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 2/235 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 34/269 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 256/525 variables, 269/318 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 32/350 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 2/527 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/527 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 353 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 271/271 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 208/233 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:20] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2024-05-22 14:57:20] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:20] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:20] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-22 14:57:20] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:20] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-22 14:57:20] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-22 14:57:20] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:20] [INFO ] Deduced a trap composed of 106 places in 75 ms of which 2 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 107 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 1 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 112 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 94 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 108 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 109 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 109 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 105 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 104 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 125 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 117 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:21] [INFO ] Deduced a trap composed of 114 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 117 places in 76 ms of which 2 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 119 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 100 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 121 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 122 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 125 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 121 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 118 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 120 places in 76 ms of which 9 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 108 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 126 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:22] [INFO ] Deduced a trap composed of 103 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 118 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 113 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 104 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 103 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 111 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 128 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 1 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 121 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 116 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 108 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 109 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:23] [INFO ] Deduced a trap composed of 123 places in 80 ms of which 2 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 122 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 124 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 99 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 127 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 123 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 123 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 127 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 117 places in 80 ms of which 1 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:24] [INFO ] Deduced a trap composed of 121 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 100 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 104 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 101 places in 75 ms of which 2 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 101 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 97 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 122 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 116 places in 78 ms of which 2 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 122 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 125 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 109 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:25] [INFO ] Deduced a trap composed of 127 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 126 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 125 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 127 places in 78 ms of which 3 ms to minimize.
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 121 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 1 ms to minimize.
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 113 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 112 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 100 places in 79 ms of which 2 ms to minimize.
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 99 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 122 places in 75 ms of which 2 ms to minimize.
[2024-05-22 14:57:26] [INFO ] Deduced a trap composed of 110 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 100 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 108 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 125 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 118 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 118 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 114 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 122 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 126 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 124 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 110 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 108 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:27] [INFO ] Deduced a trap composed of 120 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 124 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 125 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 117 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 116 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 114 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 123 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 132 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 100 places in 81 ms of which 1 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 119 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:28] [INFO ] Deduced a trap composed of 119 places in 80 ms of which 1 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 119 places in 80 ms of which 2 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 123 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 111 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 115 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 124 places in 79 ms of which 2 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 102 places in 75 ms of which 2 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 128 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 106 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 106 places in 76 ms of which 2 ms to minimize.
[2024-05-22 14:57:29] [INFO ] Deduced a trap composed of 101 places in 77 ms of which 2 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 108 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 118 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 100 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 99 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 107 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 116 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 123 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:57:30] [INFO ] Deduced a trap composed of 109 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 114 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 101 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 111 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 120 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 99 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 106 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 100 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 112 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 99 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 114 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 109 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:57:31] [INFO ] Deduced a trap composed of 106 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 116 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 99 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 100 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 114 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 100 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 100 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 110 places in 79 ms of which 1 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 107 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 116 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:32] [INFO ] Deduced a trap composed of 124 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 113 places in 96 ms of which 2 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 112 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 115 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 122 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 119 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 121 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 118 places in 79 ms of which 1 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 109 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 106 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:33] [INFO ] Deduced a trap composed of 120 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 117 places in 82 ms of which 1 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 121 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 113 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 129 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 112 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 112 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 115 places in 82 ms of which 1 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 102 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 103 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 109 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:34] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 1 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 119 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 107 places in 79 ms of which 2 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 122 places in 75 ms of which 2 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 113 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 113 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 119 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 130 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:35] [INFO ] Deduced a trap composed of 110 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 129 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 117 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 117 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 103 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 104 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 106 places in 75 ms of which 2 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 107 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 4 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 117 places in 82 ms of which 2 ms to minimize.
[2024-05-22 14:57:36] [INFO ] Deduced a trap composed of 118 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 103 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 115 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 103 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 108 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 123 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 107 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 100 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 117 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 108 places in 82 ms of which 1 ms to minimize.
[2024-05-22 14:57:37] [INFO ] Deduced a trap composed of 115 places in 76 ms of which 2 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 123 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 101 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 120 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 120 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 108 places in 70 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 111 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 116 places in 69 ms of which 3 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 117 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 118 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 104 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 116 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:38] [INFO ] Deduced a trap composed of 121 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 109 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 124 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 102 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 119 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 120 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 106 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 121 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 123 places in 76 ms of which 2 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 118 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 123 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:39] [INFO ] Deduced a trap composed of 102 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 122 places in 77 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 112 places in 82 ms of which 1 ms to minimize.
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 121 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 122 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 103 places in 76 ms of which 2 ms to minimize.
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 109 places in 81 ms of which 1 ms to minimize.
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 106 places in 75 ms of which 2 ms to minimize.
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 121 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 136 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 124 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:40] [INFO ] Deduced a trap composed of 125 places in 75 ms of which 2 ms to minimize.
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 132 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 125 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 121 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 111 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 128 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 131 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 130 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 117 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 103 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 122 places in 68 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:41] [INFO ] Deduced a trap composed of 102 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 108 places in 79 ms of which 2 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 121 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 103 places in 80 ms of which 1 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 120 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 115 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 116 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 102 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 118 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:42] [INFO ] Deduced a trap composed of 104 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:43] [INFO ] Deduced a trap composed of 119 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:43] [INFO ] Deduced a trap composed of 119 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:57:43] [INFO ] Deduced a trap composed of 95 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:43] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:43] [INFO ] Deduced a trap composed of 125 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:43] [INFO ] Deduced a trap composed of 119 places in 78 ms of which 1 ms to minimize.
[2024-05-22 14:57:43] [INFO ] Deduced a trap composed of 103 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:43] [INFO ] Deduced a trap composed of 112 places in 81 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 109 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 107 places in 83 ms of which 2 ms to minimize.
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 119 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 115 places in 79 ms of which 2 ms to minimize.
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 115 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 2 ms to minimize.
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 104 places in 76 ms of which 2 ms to minimize.
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 115 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 114 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 125 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:44] [INFO ] Deduced a trap composed of 101 places in 75 ms of which 2 ms to minimize.
[2024-05-22 14:57:45] [INFO ] Deduced a trap composed of 122 places in 80 ms of which 2 ms to minimize.
[2024-05-22 14:57:45] [INFO ] Deduced a trap composed of 116 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:45] [INFO ] Deduced a trap composed of 119 places in 76 ms of which 2 ms to minimize.
[2024-05-22 14:57:45] [INFO ] Deduced a trap composed of 130 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:45] [INFO ] Deduced a trap composed of 118 places in 89 ms of which 3 ms to minimize.
[2024-05-22 14:57:45] [INFO ] Deduced a trap composed of 126 places in 77 ms of which 2 ms to minimize.
[2024-05-22 14:57:45] [INFO ] Deduced a trap composed of 126 places in 82 ms of which 2 ms to minimize.
[2024-05-22 14:57:45] [INFO ] Deduced a trap composed of 114 places in 79 ms of which 1 ms to minimize.
[2024-05-22 14:57:45] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 20/331 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:46] [INFO ] Deduced a trap composed of 112 places in 78 ms of which 1 ms to minimize.
[2024-05-22 14:57:46] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 1 ms to minimize.
[2024-05-22 14:57:46] [INFO ] Deduced a trap composed of 101 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:46] [INFO ] Deduced a trap composed of 99 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:46] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:46] [INFO ] Deduced a trap composed of 122 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:46] [INFO ] Deduced a trap composed of 122 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:46] [INFO ] Deduced a trap composed of 120 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:46] [INFO ] Deduced a trap composed of 123 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:46] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:47] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:57:47] [INFO ] Deduced a trap composed of 113 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:47] [INFO ] Deduced a trap composed of 106 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:47] [INFO ] Deduced a trap composed of 125 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:47] [INFO ] Deduced a trap composed of 103 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:47] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:47] [INFO ] Deduced a trap composed of 125 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:57:47] [INFO ] Deduced a trap composed of 121 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:47] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:47] [INFO ] Deduced a trap composed of 119 places in 74 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 118 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 110 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 122 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 119 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 100 places in 78 ms of which 1 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 123 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 125 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 126 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 128 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 106 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:48] [INFO ] Deduced a trap composed of 124 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 106 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 100 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 113 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 124 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 113 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 115 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 104 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 113 places in 73 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 125 places in 77 ms of which 2 ms to minimize.
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 108 places in 81 ms of which 1 ms to minimize.
[2024-05-22 14:57:49] [INFO ] Deduced a trap composed of 116 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 124 places in 79 ms of which 1 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 122 places in 78 ms of which 1 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 104 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 122 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 125 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 120 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 101 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 122 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 121 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:50] [INFO ] Deduced a trap composed of 122 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 102 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 111 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 100 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 113 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 128 places in 66 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/233 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 115 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 111 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 115 places in 77 ms of which 2 ms to minimize.
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 130 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 111 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:51] [INFO ] Deduced a trap composed of 111 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 111 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 108 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 111 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 121 places in 75 ms of which 2 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 123 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 106 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 115 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 119 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 109 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 121 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:52] [INFO ] Deduced a trap composed of 130 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 115 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 120 places in 67 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/233 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 109 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 101 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 101 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:53] [INFO ] Deduced a trap composed of 120 places in 77 ms of which 2 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 124 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 106 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 109 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 129 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 101 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 120 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 107 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 122 places in 78 ms of which 2 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 125 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:54] [INFO ] Deduced a trap composed of 106 places in 68 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/233 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 127 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 126 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 107 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 105 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 105 places in 76 ms of which 2 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 125 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 107 places in 80 ms of which 2 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 107 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 125 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:55] [INFO ] Deduced a trap composed of 108 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:56] [INFO ] Deduced a trap composed of 117 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:56] [INFO ] Deduced a trap composed of 104 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:56] [INFO ] Deduced a trap composed of 103 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:57:56] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:56] [INFO ] Deduced a trap composed of 122 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:57:56] [INFO ] Deduced a trap composed of 124 places in 63 ms of which 2 ms to minimize.
[2024-05-22 14:57:56] [INFO ] Deduced a trap composed of 114 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:56] [INFO ] Deduced a trap composed of 105 places in 63 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/233 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:56] [INFO ] Deduced a trap composed of 109 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 123 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 128 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 126 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 114 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 103 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 108 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 115 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:57:57] [INFO ] Deduced a trap composed of 113 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 116 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 123 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 103 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 119 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 117 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 104 places in 67 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/233 variables, 20/471 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 118 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 109 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 113 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:58] [INFO ] Deduced a trap composed of 101 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 122 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 124 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 103 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 123 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 122 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 128 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 130 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 109 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 122 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 122 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 125 places in 77 ms of which 2 ms to minimize.
[2024-05-22 14:57:59] [INFO ] Deduced a trap composed of 129 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:58:00] [INFO ] Deduced a trap composed of 104 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:58:00] [INFO ] Deduced a trap composed of 122 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:00] [INFO ] Deduced a trap composed of 122 places in 64 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/233 variables, 20/491 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:58:00] [INFO ] Deduced a trap composed of 114 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:58:00] [INFO ] Deduced a trap composed of 112 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:00] [INFO ] Deduced a trap composed of 114 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:58:00] [INFO ] Deduced a trap composed of 102 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:58:00] [INFO ] Deduced a trap composed of 107 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:58:00] [INFO ] Deduced a trap composed of 103 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 101 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 121 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 123 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 110 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 112 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 106 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 119 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 108 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 123 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 102 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 125 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:01] [INFO ] Deduced a trap composed of 121 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 105 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 102 places in 72 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/233 variables, 20/511 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 96 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 128 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 119 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 116 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 119 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 115 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 103 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:58:02] [INFO ] Deduced a trap composed of 113 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 133 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 123 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 108 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 121 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 115 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 101 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 127 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 130 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 129 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 129 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:58:03] [INFO ] Deduced a trap composed of 129 places in 67 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/233 variables, 20/531 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 105 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 113 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 104 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 119 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 127 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 116 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 111 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 105 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 116 places in 81 ms of which 2 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 111 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:58:04] [INFO ] Deduced a trap composed of 119 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:58:05] [INFO ] Deduced a trap composed of 127 places in 77 ms of which 1 ms to minimize.
[2024-05-22 14:58:05] [INFO ] Deduced a trap composed of 127 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:58:05] [INFO ] Deduced a trap composed of 126 places in 69 ms of which 1 ms to minimize.
SMT process timed out in 46191ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 256/256 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 266 transition count 251
Applied a total of 10 rules in 18 ms. Remains 266 /271 variables (removed 5) and now considering 251/256 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 266/271 places, 251/256 transitions.
RANDOM walk for 40000 steps (5058 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3367 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3301 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3320 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3387 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3424 resets) in 108 ms. (366 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3382 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3375 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3353 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3341 resets) in 171 ms. (232 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3402 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3457 resets) in 154 ms. (258 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3372 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3337 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 249721 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :1 out of 13
Probabilistic random walk after 249721 steps, saw 124910 distinct states, run finished after 3004 ms. (steps per millisecond=83 ) properties seen :1
// Phase 1: matrix 251 rows 266 cols
[2024-05-22 14:58:09] [INFO ] Computed 50 invariants in 14 ms
[2024-05-22 14:58:09] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 190/213 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 49/262 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 251/513 variables, 262/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 32/342 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 4/517 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/517 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 348 constraints, problems are : Problem set: 0 solved, 12 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 266/266 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 190/213 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:10] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 14:58:10] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:58:10] [INFO ] Deduced a trap composed of 106 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:58:10] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:58:10] [INFO ] Deduced a trap composed of 108 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:58:10] [INFO ] Deduced a trap composed of 107 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:58:10] [INFO ] Deduced a trap composed of 108 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:58:10] [INFO ] Deduced a trap composed of 107 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:58:10] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:58:10] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 97 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 106 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 102 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 2 ms to minimize.
[2024-05-22 14:58:11] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 100 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 100 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 96 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 101 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:12] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 2 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 109 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 117 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 100 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 118 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 120 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 103 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 2 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 118 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 107 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:13] [INFO ] Deduced a trap composed of 120 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 95 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 102 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 114 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 122 places in 71 ms of which 2 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 112 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 117 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 116 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 101 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 120 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 105 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 107 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:14] [INFO ] Deduced a trap composed of 105 places in 58 ms of which 2 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 108 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 98 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 98 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 94 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 108 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 108 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:15] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 99 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 99 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 106 places in 63 ms of which 2 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:16] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 123 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 111 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 113 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:17] [INFO ] Deduced a trap composed of 104 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 119 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 119 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 98 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 113 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 93 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 116 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 117 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:58:18] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 111 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 99 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 102 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 106 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 2 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:19] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 120 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 101 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:20] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 2 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 111 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 98 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 95 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 115 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 99 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 113 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:21] [INFO ] Deduced a trap composed of 112 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 98 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 103 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 106 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 112 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:58:22] [INFO ] Deduced a trap composed of 125 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 113 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 102 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 110 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 121 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:23] [INFO ] Deduced a trap composed of 123 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 100 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 121 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 100 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 106 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 116 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 101 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 101 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:24] [INFO ] Deduced a trap composed of 120 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 120 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 112 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:25] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 105 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 123 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:26] [INFO ] Deduced a trap composed of 125 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 108 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 2 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 96 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 2 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 113 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:27] [INFO ] Deduced a trap composed of 102 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 101 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 104 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 92 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 2 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 112 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 121 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 105 places in 63 ms of which 2 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 2 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 108 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:28] [INFO ] Deduced a trap composed of 92 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 112 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 98 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 2 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:29] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 122 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 108 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 2 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2024-05-22 14:58:30] [INFO ] Deduced a trap composed of 118 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 2 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 106 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 103 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 100 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 123 places in 73 ms of which 1 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 123 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 108 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/213 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 117 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 109 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 105 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:31] [INFO ] Deduced a trap composed of 110 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 90 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 96 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 94 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 2 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 109 places in 56 ms of which 2 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 2 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 114 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:32] [INFO ] Deduced a trap composed of 109 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 20/345 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 105 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 113 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 113 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 2 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 127 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 127 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 110 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 106 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 108 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 114 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 112 places in 54 ms of which 2 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:33] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 2 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/213 variables, 20/365 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 112 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 111 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 112 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 111 places in 57 ms of which 2 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 3 ms to minimize.
[2024-05-22 14:58:34] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 2 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 112 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 110 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 118 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 113 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/213 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:58:35] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 91 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 93 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 129 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 112 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 114 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 118 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 118 places in 59 ms of which 2 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 2 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:36] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 81 places in 51 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/213 variables, 20/405 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 108 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 108 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 101 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 106 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 108 places in 56 ms of which 2 ms to minimize.
[2024-05-22 14:58:37] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 2 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 2 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 101 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 101 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 93 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 117 places in 61 ms of which 2 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 119 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 107 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 109 places in 52 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/213 variables, 20/425 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 121 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 114 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:38] [INFO ] Deduced a trap composed of 114 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 113 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 109 places in 57 ms of which 2 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 119 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 120 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 119 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 120 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 109 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 110 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 110 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:39] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:40] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/213 variables, 20/445 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:40] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:40] [INFO ] Deduced a trap composed of 97 places in 54 ms of which 2 ms to minimize.
[2024-05-22 14:58:40] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:40] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:40] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:40] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:40] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/213 variables, 7/452 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:40] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 100 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 105 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 107 places in 60 ms of which 2 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 94 places in 56 ms of which 2 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 103 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 105 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 96 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:41] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/213 variables, 13/465 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 114 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 101 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 100 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 112 places in 67 ms of which 1 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 115 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 2 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 93 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 118 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:42] [INFO ] Deduced a trap composed of 114 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 114 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 107 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/213 variables, 20/485 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 101 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:43] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 101 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 104 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 2 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 108 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 107 places in 59 ms of which 2 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 93 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 102 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 99 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:44] [INFO ] Deduced a trap composed of 102 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/213 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 94 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 98 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 2 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 92 places in 52 ms of which 2 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:45] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 107 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 2 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 98 places in 57 ms of which 2 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 96 places in 54 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/213 variables, 20/525 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 109 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 2 ms to minimize.
[2024-05-22 14:58:46] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 2 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 105 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 95 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 113 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 102 places in 50 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 93 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 106 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 96 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 102 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 99 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:47] [INFO ] Deduced a trap composed of 96 places in 54 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/213 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 102 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 96 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 103 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 96 places in 51 ms of which 2 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 94 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 102 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:48] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:49] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:49] [INFO ] Deduced a trap composed of 103 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:58:49] [INFO ] Deduced a trap composed of 98 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:49] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:49] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/213 variables, 18/563 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/213 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 49/262 variables, 23/586 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:49] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-22 14:58:49] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:58:49] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:49] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 1 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
[2024-05-22 14:58:50] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 1 ms to minimize.
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 1 ms to minimize.
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 1 ms to minimize.
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/262 variables, 20/606 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:58:51] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:52] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 1 ms to minimize.
[2024-05-22 14:58:53] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-22 14:58:53] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-22 14:58:53] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/262 variables, 20/626 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:53] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2024-05-22 14:58:53] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2024-05-22 14:58:53] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:58:53] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:58:53] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/262 variables, 5/631 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:58:53] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-05-22 14:58:53] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:58:54] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/262 variables, 3/634 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/262 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (OVERLAPS) 251/513 variables, 262/896 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/513 variables, 32/928 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/513 variables, 12/940 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:59:02] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-22 14:59:03] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 1 ms to minimize.
[2024-05-22 14:59:03] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2024-05-22 14:59:03] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/513 variables, 4/944 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:59:04] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:59:04] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/513 variables, 2/946 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:59:06] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2024-05-22 14:59:06] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-22 14:59:06] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-22 14:59:06] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
[2024-05-22 14:59:06] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-22 14:59:06] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 1 ms to minimize.
[2024-05-22 14:59:07] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-22 14:59:07] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2024-05-22 14:59:07] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:59:07] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:59:07] [INFO ] Deduced a trap composed of 102 places in 85 ms of which 1 ms to minimize.
[2024-05-22 14:59:07] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-22 14:59:07] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/513 variables, 13/959 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 14:59:08] [INFO ] Deduced a trap composed of 99 places in 80 ms of which 1 ms to minimize.
[2024-05-22 14:59:08] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-05-22 14:59:09] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/513 variables, 3/962 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/513 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (OVERLAPS) 4/517 variables, 4/966 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/517 variables, 2/968 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/517 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (OVERLAPS) 0/517 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 968 constraints, problems are : Problem set: 0 solved, 12 unsolved in 64830 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 266/266 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 608/608 constraints]
After SMT, in 65834ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 30002 ms.
Support contains 23 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 251/251 transitions.
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 2 place count 265 transition count 250
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 265 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 264 transition count 249
Applied a total of 4 rules in 28 ms. Remains 264 /266 variables (removed 2) and now considering 249/251 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 264/266 places, 249/251 transitions.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA DoubleExponent-PT-010-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 896 edges and 528 vertex of which 525 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 376
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 406 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 241 place count 405 transition count 354
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 463 place count 294 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 499 place count 276 transition count 264
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 501 place count 276 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 502 place count 275 transition count 263
Iterating global reduction 3 with 1 rules applied. Total rules applied 503 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 504 place count 274 transition count 262
Applied a total of 504 rules in 73 ms. Remains 274 /528 variables (removed 254) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 14:59:45] [INFO ] Computed 49 invariants in 10 ms
[2024-05-22 14:59:45] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 14:59:45] [INFO ] Invariant cache hit.
[2024-05-22 14:59:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 14:59:46] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
[2024-05-22 14:59:46] [INFO ] Redundant transitions in 16 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 14:59:46] [INFO ] Invariant cache hit.
[2024-05-22 14:59:46] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 14:59:58] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:00:00] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:00:00] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:00:00] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:00:01] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-05-22 15:00:01] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:00:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 348 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/536 variables, and 599 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 258/261 constraints, Known Traps: 0/7 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61544 ms. Remains : 274/528 places, 262/497 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-00
Product exploration explored 100000 steps with 13844 reset in 209 ms.
Product exploration explored 100000 steps with 13842 reset in 140 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5551 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3225 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 762977 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 1
Probabilistic random walk after 762977 steps, saw 381605 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
[2024-05-22 15:00:50] [INFO ] Invariant cache hit.
[2024-05-22 15:00:50] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/64 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/74 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/108 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 96/204 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 77/281 variables, 24/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/281 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/289 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/289 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 227/516 variables, 226/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/516 variables, 15/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/516 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 20/536 variables, 19/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/536 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/64 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/74 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/108 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 96/204 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 77/281 variables, 24/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/289 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 227/516 variables, 226/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/516 variables, 15/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/516 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/536 variables, 19/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:00:50] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:00:51] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:00:51] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:00:51] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:00:51] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:00:51] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-22 15:00:51] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:00:51] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:00:51] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:00:51] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/536 variables, 10/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/536 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/536 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 352 constraints, problems are : Problem set: 0 solved, 1 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1010ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3236 ms.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 812 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 273 transition count 225
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 237 transition count 225
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 113 place count 237 transition count 225
Applied a total of 113 rules in 32 ms. Remains 237 /274 variables (removed 37) and now considering 225/262 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 237/274 places, 225/262 transitions.
RANDOM walk for 40000 steps (5120 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3405 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 803311 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 1
Probabilistic random walk after 803311 steps, saw 401907 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
// Phase 1: matrix 225 rows 237 cols
[2024-05-22 15:00:57] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 15:00:57] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/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) 177/221 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/232 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 225/457 variables, 232/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 36/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/462 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 237/237 constraints, ReadFeed: 36/36 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/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) 177/221 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:00:58] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-22 15:00:58] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-22 15:00:58] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2024-05-22 15:00:58] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:00:58] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2024-05-22 15:00:58] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2024-05-22 15:00:58] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:00:58] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2024-05-22 15:00:58] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 1 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 1 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 1 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:01:04] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2024-05-22 15:01:04] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2024-05-22 15:01:04] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/232 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:01:04] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 225/457 variables, 232/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 36/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/462 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/462 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/462 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6685 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 237/237 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 67/67 constraints]
After SMT, in 6849ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3246 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 237/237 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-22 15:01:07] [INFO ] Invariant cache hit.
[2024-05-22 15:01:08] [INFO ] Implicit Places using invariants in 334 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 150, 155, 178, 184, 191, 228, 234]
[2024-05-22 15:01:08] [INFO ] Actually due to overlaps returned [191, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 345 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/237 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 224
Applied a total of 2 rules in 12 ms. Remains 234 /235 variables (removed 1) and now considering 224/225 (removed 1) transitions.
// Phase 1: matrix 224 rows 234 cols
[2024-05-22 15:01:08] [INFO ] Computed 47 invariants in 7 ms
[2024-05-22 15:01:08] [INFO ] Implicit Places using invariants in 273 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 177, 183, 225, 231]
[2024-05-22 15:01:08] [INFO ] Actually due to overlaps returned [231, 225]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 274 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 232/237 places, 224/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Applied a total of 2 rules in 19 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-05-22 15:01:08] [INFO ] Computed 45 invariants in 9 ms
[2024-05-22 15:01:08] [INFO ] Implicit Places using invariants in 230 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 177, 183]
[2024-05-22 15:01:08] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 231 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 229/237 places, 223/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 222
Applied a total of 2 rules in 10 ms. Remains 228 /229 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 228 cols
[2024-05-22 15:01:08] [INFO ] Computed 43 invariants in 7 ms
[2024-05-22 15:01:09] [INFO ] Implicit Places using invariants in 215 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 174, 180]
[2024-05-22 15:01:09] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 216 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 226/237 places, 222/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 221
Applied a total of 2 rules in 9 ms. Remains 225 /226 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 225 cols
[2024-05-22 15:01:09] [INFO ] Computed 41 invariants in 8 ms
[2024-05-22 15:01:09] [INFO ] Implicit Places using invariants in 195 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 171, 177]
[2024-05-22 15:01:09] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 207 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 223/237 places, 221/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 220
Applied a total of 2 rules in 8 ms. Remains 222 /223 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 222 cols
[2024-05-22 15:01:09] [INFO ] Computed 39 invariants in 10 ms
[2024-05-22 15:01:09] [INFO ] Implicit Places using invariants in 176 ms returned [88, 94, 115, 120, 140, 145, 168, 174]
[2024-05-22 15:01:09] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 178 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 220/237 places, 220/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 219
Applied a total of 2 rules in 8 ms. Remains 219 /220 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 219 cols
[2024-05-22 15:01:09] [INFO ] Computed 37 invariants in 15 ms
[2024-05-22 15:01:09] [INFO ] Implicit Places using invariants in 169 ms returned [112, 117, 137, 142, 165, 171]
[2024-05-22 15:01:09] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 170 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 217/237 places, 219/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 9 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-22 15:01:09] [INFO ] Computed 35 invariants in 9 ms
[2024-05-22 15:01:09] [INFO ] Implicit Places using invariants in 182 ms returned [134, 139, 162, 168]
[2024-05-22 15:01:09] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 183 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 214/237 places, 218/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 7 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 213 cols
[2024-05-22 15:01:09] [INFO ] Computed 33 invariants in 11 ms
[2024-05-22 15:01:09] [INFO ] Implicit Places using invariants in 144 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 144 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 211/237 places, 217/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 7 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 15:01:10] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 15:01:10] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 15:01:10] [INFO ] Invariant cache hit.
[2024-05-22 15:01:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:01:11] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 210/237 places, 216/225 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3835 ms. Remains : 210/237 places, 216/225 transitions.
RANDOM walk for 40000 steps (5744 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3670 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 873756 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 1
Probabilistic random walk after 873756 steps, saw 436960 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
[2024-05-22 15:01:14] [INFO ] Invariant cache hit.
[2024-05-22 15:01:14] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/205 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/421 variables, 205/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 36/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/426 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:01:15] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/205 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 216/421 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 36/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:01:15] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/426 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:01:15] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:01:15] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:01:15] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:01:15] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:01:15] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:01:16] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:01:16] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:01:16] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:01:16] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:01:16] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:01:16] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:01:16] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:01:16] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:01:16] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:01:16] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:01:17] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:01:17] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:01:17] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:01:17] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:01:17] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:01:17] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:01:17] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:01:17] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:01:18] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:01:18] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:01:18] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:01:18] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 7/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3337 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 3514ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1212 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 15:01:19] [INFO ] Invariant cache hit.
[2024-05-22 15:01:19] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 15:01:19] [INFO ] Invariant cache hit.
[2024-05-22 15:01:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:01:21] [INFO ] Implicit Places using invariants and state equation in 1689 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2024-05-22 15:01:21] [INFO ] Redundant transitions in 4 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 15:01:21] [INFO ] Invariant cache hit.
[2024-05-22 15:01:21] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 36/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 277 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9216 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 36/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 215/492 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:01:39] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:01:39] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-22 15:01:39] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:01:43] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:01:44] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:01:44] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 2 ms to minimize.
[2024-05-22 15:01:44] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:01:44] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:01:44] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:01:49] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:01:50] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:01:50] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:01:51] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:01:51] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:01:51] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:01:51] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:01:51] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:01:51] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:01:52] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:01:52] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 11/523 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:01:58] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 524 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 32/32 constraints]
After SMT, in 39317ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39320ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41164 ms. Remains : 210/210 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 180 transition count 186
Applied a total of 60 rules in 34 ms. Remains 180 /210 variables (removed 30) and now considering 186/216 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 15:02:00] [INFO ] Computed 31 invariants in 8 ms
[2024-05-22 15:02:00] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:02:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:02:00] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:02:01] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:02:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:02:01] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:02:01] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:02:01] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:02:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
TRAPS : Iteration 1
[2024-05-22 15:02:01] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:02:01] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:02:01] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:02:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
TRAPS : Iteration 2
[2024-05-22 15:02:01] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:02:01] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 735 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 12 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 15:02:01] [INFO ] Computed 49 invariants in 11 ms
[2024-05-22 15:02:01] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 15:02:01] [INFO ] Invariant cache hit.
[2024-05-22 15:02:02] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:02:03] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2024-05-22 15:02:03] [INFO ] Redundant transitions in 8 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 15:02:03] [INFO ] Invariant cache hit.
[2024-05-22 15:02:03] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:02:14] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:02:16] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:02:16] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:02:16] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:02:17] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2024-05-22 15:02:17] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:02:22] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 348 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60075ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61474 ms. Remains : 274/274 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5560 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3229 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 661158 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 1
Probabilistic random walk after 661158 steps, saw 330672 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
[2024-05-22 15:03:06] [INFO ] Invariant cache hit.
[2024-05-22 15:03:06] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/64 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/74 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/108 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 96/204 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 77/281 variables, 24/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/281 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/289 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/289 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 227/516 variables, 226/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/516 variables, 15/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/516 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 20/536 variables, 19/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/536 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/64 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/74 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/108 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 96/204 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 77/281 variables, 24/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/289 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 227/516 variables, 226/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/516 variables, 15/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/516 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/536 variables, 19/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:03:06] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:03:06] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-22 15:03:06] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:03:07] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:03:07] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:03:07] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:03:07] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-22 15:03:07] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:03:07] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:03:07] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/536 variables, 10/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/536 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/536 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 352 constraints, problems are : Problem set: 0 solved, 1 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1054ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3750 ms.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 812 edges and 274 vertex of which 273 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 273 transition count 225
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 237 transition count 225
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 113 place count 237 transition count 225
Applied a total of 113 rules in 17 ms. Remains 237 /274 variables (removed 37) and now considering 225/262 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 237/274 places, 225/262 transitions.
RANDOM walk for 40000 steps (5099 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3366 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 709597 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 1
Probabilistic random walk after 709597 steps, saw 355013 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
// Phase 1: matrix 225 rows 237 cols
[2024-05-22 15:03:14] [INFO ] Computed 49 invariants in 17 ms
[2024-05-22 15:03:14] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/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) 177/221 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/232 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 225/457 variables, 232/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 36/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/462 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 237/237 constraints, ReadFeed: 36/36 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/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) 177/221 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:03:14] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-22 15:03:14] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-22 15:03:14] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-22 15:03:14] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:03:15] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:03:15] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-22 15:03:15] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:03:15] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:03:15] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-22 15:03:15] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2024-05-22 15:03:15] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-05-22 15:03:15] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:03:15] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-05-22 15:03:15] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:03:16] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-22 15:03:16] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:03:16] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2024-05-22 15:03:16] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:03:16] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 1 ms to minimize.
[2024-05-22 15:03:16] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:03:16] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 1 ms to minimize.
[2024-05-22 15:03:16] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 1 ms to minimize.
[2024-05-22 15:03:16] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:03:16] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:03:17] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:03:17] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:03:17] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:03:17] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:03:17] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-22 15:03:17] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-22 15:03:17] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
[2024-05-22 15:03:17] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-22 15:03:17] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:03:17] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 1 ms to minimize.
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:03:18] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:03:19] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/232 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:03:20] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 225/457 variables, 232/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 36/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/462 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/462 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/462 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6922 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 237/237 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 67/67 constraints]
After SMT, in 7103ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3684 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 237/237 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 16 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-22 15:03:25] [INFO ] Invariant cache hit.
[2024-05-22 15:03:25] [INFO ] Implicit Places using invariants in 299 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 150, 155, 178, 184, 191, 228, 234]
[2024-05-22 15:03:25] [INFO ] Actually due to overlaps returned [191, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 300 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/237 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 224
Applied a total of 2 rules in 9 ms. Remains 234 /235 variables (removed 1) and now considering 224/225 (removed 1) transitions.
// Phase 1: matrix 224 rows 234 cols
[2024-05-22 15:03:25] [INFO ] Computed 47 invariants in 8 ms
[2024-05-22 15:03:25] [INFO ] Implicit Places using invariants in 256 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 177, 183, 225, 231]
[2024-05-22 15:03:25] [INFO ] Actually due to overlaps returned [231, 225]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 257 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 232/237 places, 224/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Applied a total of 2 rules in 8 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-05-22 15:03:25] [INFO ] Computed 45 invariants in 12 ms
[2024-05-22 15:03:25] [INFO ] Implicit Places using invariants in 233 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 177, 183]
[2024-05-22 15:03:25] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 233 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 229/237 places, 223/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 222
Applied a total of 2 rules in 8 ms. Remains 228 /229 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 228 cols
[2024-05-22 15:03:25] [INFO ] Computed 43 invariants in 9 ms
[2024-05-22 15:03:26] [INFO ] Implicit Places using invariants in 214 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 174, 180]
[2024-05-22 15:03:26] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 215 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 226/237 places, 222/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 221
Applied a total of 2 rules in 8 ms. Remains 225 /226 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 225 cols
[2024-05-22 15:03:26] [INFO ] Computed 41 invariants in 10 ms
[2024-05-22 15:03:26] [INFO ] Implicit Places using invariants in 195 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 171, 177]
[2024-05-22 15:03:26] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 195 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 223/237 places, 221/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 220
Applied a total of 2 rules in 8 ms. Remains 222 /223 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 222 cols
[2024-05-22 15:03:26] [INFO ] Computed 39 invariants in 13 ms
[2024-05-22 15:03:26] [INFO ] Implicit Places using invariants in 176 ms returned [88, 94, 115, 120, 140, 145, 168, 174]
[2024-05-22 15:03:26] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 177 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 220/237 places, 220/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 219
Applied a total of 2 rules in 7 ms. Remains 219 /220 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 219 cols
[2024-05-22 15:03:26] [INFO ] Computed 37 invariants in 10 ms
[2024-05-22 15:03:26] [INFO ] Implicit Places using invariants in 154 ms returned [112, 117, 137, 142, 165, 171]
[2024-05-22 15:03:26] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 155 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 217/237 places, 219/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 6 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-22 15:03:26] [INFO ] Computed 35 invariants in 10 ms
[2024-05-22 15:03:26] [INFO ] Implicit Places using invariants in 158 ms returned [134, 139, 162, 168]
[2024-05-22 15:03:26] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 159 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 214/237 places, 218/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 6 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 213 cols
[2024-05-22 15:03:26] [INFO ] Computed 33 invariants in 10 ms
[2024-05-22 15:03:26] [INFO ] Implicit Places using invariants in 139 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 139 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 211/237 places, 217/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 6 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 15:03:26] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 15:03:27] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 15:03:27] [INFO ] Invariant cache hit.
[2024-05-22 15:03:27] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:03:28] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 210/237 places, 216/225 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3772 ms. Remains : 210/237 places, 216/225 transitions.
RANDOM walk for 40000 steps (5801 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3645 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 765935 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :0 out of 1
Probabilistic random walk after 765935 steps, saw 383040 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
[2024-05-22 15:03:31] [INFO ] Invariant cache hit.
[2024-05-22 15:03:31] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/205 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/421 variables, 205/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 36/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/426 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:03:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/205 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 216/421 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 36/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:03:32] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/426 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:03:32] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:03:32] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 2 ms to minimize.
[2024-05-22 15:03:32] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:03:32] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:03:32] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:03:33] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:03:33] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:03:33] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:03:33] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:03:33] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-22 15:03:33] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:03:33] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:03:33] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:03:33] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:03:33] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:03:34] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:03:34] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:03:34] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:03:34] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:03:34] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:03:34] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:03:34] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:03:35] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:03:35] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:03:35] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:03:35] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-22 15:03:35] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 7/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3387 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 3579ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1226 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 15:03:36] [INFO ] Invariant cache hit.
[2024-05-22 15:03:36] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 15:03:36] [INFO ] Invariant cache hit.
[2024-05-22 15:03:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:03:38] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2024-05-22 15:03:38] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 15:03:38] [INFO ] Invariant cache hit.
[2024-05-22 15:03:38] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 36/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 277 constraints, problems are : Problem set: 0 solved, 215 unsolved in 8995 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 36/277 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 215/492 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:03:55] [INFO ] Deduced a trap composed of 96 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:03:55] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:03:56] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-05-22 15:03:59] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:03:59] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:03:59] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:03:59] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:03:59] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 2 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:04:00] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:04:01] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:04:05] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:04:06] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:04:06] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:04:07] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:04:07] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:04:07] [INFO ] Deduced a trap composed of 95 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:04:07] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:04:07] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:04:07] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:04:08] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:04:08] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 11/523 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:04:14] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 524 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 32/32 constraints]
After SMT, in 39095ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39097ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40850 ms. Remains : 210/210 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 198
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 180 transition count 186
Applied a total of 60 rules in 18 ms. Remains 180 /210 variables (removed 30) and now considering 186/216 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 15:04:17] [INFO ] Computed 31 invariants in 11 ms
[2024-05-22 15:04:17] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:04:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-22 15:04:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:04:17] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:04:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:04:17] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:04:17] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:04:17] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-22 15:04:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
TRAPS : Iteration 1
[2024-05-22 15:04:17] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:04:18] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:04:18] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:04:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
TRAPS : Iteration 2
[2024-05-22 15:04:18] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:04:18] [INFO ] After 555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 632 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13862 reset in 99 ms.
Product exploration explored 100000 steps with 13830 reset in 104 ms.
Built C files in :
/tmp/ltsmin4408533152826060621
[2024-05-22 15:04:18] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-22 15:04:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:04:18] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-22 15:04:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:04:18] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-22 15:04:18] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:04:18] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4408533152826060621
Running compilation step : cd /tmp/ltsmin4408533152826060621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 696 ms.
Running link step : cd /tmp/ltsmin4408533152826060621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4408533152826060621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5336888981087869388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 15:04:33] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 15:04:33] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 15:04:33] [INFO ] Invariant cache hit.
[2024-05-22 15:04:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:04:35] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2024-05-22 15:04:35] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 15:04:35] [INFO ] Invariant cache hit.
[2024-05-22 15:04:35] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:04:47] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:04:49] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:04:49] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:04:49] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:04:49] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:04:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:04:54] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 348 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/536 variables, and 599 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 258/261 constraints, Known Traps: 0/7 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61413 ms. Remains : 274/274 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin9947324747431366252
[2024-05-22 15:05:35] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-22 15:05:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:05:35] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-22 15:05:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:05:35] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-22 15:05:35] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:05:35] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9947324747431366252
Running compilation step : cd /tmp/ltsmin9947324747431366252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 592 ms.
Running link step : cd /tmp/ltsmin9947324747431366252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9947324747431366252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12652694947483659974.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 15:05:50] [INFO ] Flatten gal took : 18 ms
[2024-05-22 15:05:50] [INFO ] Flatten gal took : 16 ms
[2024-05-22 15:05:50] [INFO ] Time to serialize gal into /tmp/LTL8593926219369746762.gal : 13 ms
[2024-05-22 15:05:50] [INFO ] Time to serialize properties into /tmp/LTL12023732955668301371.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8593926219369746762.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12671382335633124069.hoa' '-atoms' '/tmp/LTL12023732955668301371.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12023732955668301371.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12671382335633124069.hoa
Detected timeout of ITS tools.
[2024-05-22 15:06:05] [INFO ] Flatten gal took : 14 ms
[2024-05-22 15:06:05] [INFO ] Flatten gal took : 12 ms
[2024-05-22 15:06:05] [INFO ] Time to serialize gal into /tmp/LTL1226732557602591595.gal : 3 ms
[2024-05-22 15:06:05] [INFO ] Time to serialize properties into /tmp/LTL4510311084254565787.ltl : 2 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1226732557602591595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4510311084254565787.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p502<=p481)||(p486>=1))"))))
Formula 0 simplified : FG!"((p502<=p481)||(p486>=1))"
Detected timeout of ITS tools.
[2024-05-22 15:06:20] [INFO ] Flatten gal took : 12 ms
[2024-05-22 15:06:20] [INFO ] Applying decomposition
[2024-05-22 15:06:20] [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/graph811692025009932856.txt' '-o' '/tmp/graph811692025009932856.bin' '-w' '/tmp/graph811692025009932856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph811692025009932856.bin' '-l' '-1' '-v' '-w' '/tmp/graph811692025009932856.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:06:20] [INFO ] Decomposing Gal with order
[2024-05-22 15:06:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:06:20] [INFO ] Removed a total of 207 redundant transitions.
[2024-05-22 15:06:20] [INFO ] Flatten gal took : 61 ms
[2024-05-22 15:06:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 15 ms.
[2024-05-22 15:06:20] [INFO ] Time to serialize gal into /tmp/LTL14316525221725344759.gal : 6 ms
[2024-05-22 15:06:20] [INFO ] Time to serialize properties into /tmp/LTL7734643929994183466.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14316525221725344759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7734643929994183466.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu84.p502<=gu84.p481)||(gi0.gi2.gi6.gu85.p486>=1))"))))
Formula 0 simplified : FG!"((gu84.p502<=gu84.p481)||(gi0.gi2.gi6.gu85.p486>=1))"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-00 finished in 410915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 525 transition count 378
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 408 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 239 place count 406 transition count 355
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 502 place count 274 transition count 262
Applied a total of 502 rules in 36 ms. Remains 274 /528 variables (removed 254) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 15:06:36] [INFO ] Computed 49 invariants in 8 ms
[2024-05-22 15:06:36] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 15:06:36] [INFO ] Invariant cache hit.
[2024-05-22 15:06:36] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 15:06:37] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
[2024-05-22 15:06:37] [INFO ] Redundant transitions in 0 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 15:06:37] [INFO ] Invariant cache hit.
[2024-05-22 15:06:37] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:06:49] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
[2024-05-22 15:06:49] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:06:49] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:06:50] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:06:51] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:06:51] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 346 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/536 variables, and 597 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 258/261 constraints, Known Traps: 0/6 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61296 ms. Remains : 274/528 places, 262/497 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-02
Product exploration explored 100000 steps with 13923 reset in 104 ms.
Product exploration explored 100000 steps with 13869 reset in 107 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (5484 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3216 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 669226 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 1
Probabilistic random walk after 669226 steps, saw 334702 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
[2024-05-22 15:07:40] [INFO ] Invariant cache hit.
[2024-05-22 15:07:40] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/108 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/174 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/233 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/238 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/532 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/536 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/108 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/174 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/233 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/238 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/532 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:07:41] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-22 15:07:41] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:07:41] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/532 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/532 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/536 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/536 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/536 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/536 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 881ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 236 transition count 224
Applied a total of 116 rules in 15 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 236/274 places, 224/262 transitions.
RANDOM walk for 40000 steps (5130 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3347 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 699733 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 699733 steps, saw 350098 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
// Phase 1: matrix 224 rows 236 cols
[2024-05-22 15:07:44] [INFO ] Computed 49 invariants in 11 ms
[2024-05-22 15:07:44] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/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) 173/218 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/231 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 224/455 variables, 231/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 37/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/460 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/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) 173/218 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:07:45] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:07:45] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:07:45] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:07:45] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:07:45] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:07:45] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:07:45] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:07:45] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:07:45] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:07:45] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/231 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 224/455 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 37/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/460 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/460 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1435 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 15:07:46] [INFO ] Invariant cache hit.
[2024-05-22 15:07:46] [INFO ] Implicit Places using invariants in 302 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 151, 156, 179, 185, 192, 227, 233]
[2024-05-22 15:07:46] [INFO ] Actually due to overlaps returned [192, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 304 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 223
Applied a total of 2 rules in 8 ms. Remains 233 /234 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 233 cols
[2024-05-22 15:07:46] [INFO ] Computed 47 invariants in 11 ms
[2024-05-22 15:07:46] [INFO ] Implicit Places using invariants in 256 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 150, 155, 178, 184, 224, 230]
[2024-05-22 15:07:46] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 258 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 223/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 222
Applied a total of 2 rules in 7 ms. Remains 230 /231 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 230 cols
[2024-05-22 15:07:47] [INFO ] Computed 45 invariants in 12 ms
[2024-05-22 15:07:47] [INFO ] Implicit Places using invariants in 232 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 150, 155, 178, 184]
[2024-05-22 15:07:47] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 234 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 222/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 221
Applied a total of 2 rules in 9 ms. Remains 227 /228 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 227 cols
[2024-05-22 15:07:47] [INFO ] Computed 43 invariants in 12 ms
[2024-05-22 15:07:47] [INFO ] Implicit Places using invariants in 217 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 147, 152, 175, 181]
[2024-05-22 15:07:47] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 218 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 221/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 220
Applied a total of 2 rules in 8 ms. Remains 224 /225 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 224 cols
[2024-05-22 15:07:47] [INFO ] Computed 41 invariants in 14 ms
[2024-05-22 15:07:47] [INFO ] Implicit Places using invariants in 196 ms returned [66, 71, 91, 97, 118, 123, 144, 149, 172, 178]
[2024-05-22 15:07:47] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 197 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 220/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 219
Applied a total of 2 rules in 7 ms. Remains 221 /222 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 221 cols
[2024-05-22 15:07:47] [INFO ] Computed 39 invariants in 12 ms
[2024-05-22 15:07:47] [INFO ] Implicit Places using invariants in 174 ms returned [88, 94, 115, 120, 141, 146, 169, 175]
[2024-05-22 15:07:47] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 175 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 219/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 218
Applied a total of 2 rules in 6 ms. Remains 218 /219 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 218 cols
[2024-05-22 15:07:47] [INFO ] Computed 37 invariants in 9 ms
[2024-05-22 15:07:48] [INFO ] Implicit Places using invariants in 168 ms returned [112, 117, 138, 143, 166, 172]
[2024-05-22 15:07:48] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 169 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 218/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 217
Applied a total of 2 rules in 7 ms. Remains 215 /216 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 215 cols
[2024-05-22 15:07:48] [INFO ] Computed 35 invariants in 9 ms
[2024-05-22 15:07:48] [INFO ] Implicit Places using invariants in 154 ms returned [135, 140, 163, 169]
[2024-05-22 15:07:48] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 155 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 217/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 216
Applied a total of 2 rules in 7 ms. Remains 212 /213 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 212 cols
[2024-05-22 15:07:48] [INFO ] Computed 33 invariants in 13 ms
[2024-05-22 15:07:48] [INFO ] Implicit Places using invariants in 163 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 164 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 216/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 215
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-22 15:07:48] [INFO ] Computed 31 invariants in 12 ms
[2024-05-22 15:07:48] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 15:07:48] [INFO ] Invariant cache hit.
[2024-05-22 15:07:48] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:07:49] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 215/224 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3448 ms. Remains : 209/236 places, 215/224 transitions.
RANDOM walk for 40000 steps (5722 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3645 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 759229 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 1
Probabilistic random walk after 759229 steps, saw 379689 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2024-05-22 15:07:52] [INFO ] Invariant cache hit.
[2024-05-22 15:07:52] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/204 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 215/419 variables, 204/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 37/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/424 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 96 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 107 places in 57 ms of which 4 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 102 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 105 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 103 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 100 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 100 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 101 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/204 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:07:53] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:07:54] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:07:54] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/419 variables, 204/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 37/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:07:54] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/424 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/424 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 1750ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 15:07:54] [INFO ] Invariant cache hit.
[2024-05-22 15:07:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 15:07:54] [INFO ] Invariant cache hit.
[2024-05-22 15:07:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:07:56] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
[2024-05-22 15:07:56] [INFO ] Redundant transitions in 0 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-22 15:07:56] [INFO ] Invariant cache hit.
[2024-05-22 15:07:56] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/424 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9182 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/424 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 214/491 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:08:15] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:08:16] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:08:16] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:08:16] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:08:16] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:08:16] [INFO ] Deduced a trap composed of 98 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:08:16] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:08:16] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:08:16] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:08:16] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 10/501 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:08:22] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:08:22] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:08:22] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:08:23] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:08:23] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:08:23] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:08:23] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:08:23] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:08:23] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 2 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 2 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:08:25] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 20/521 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:08:29] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 522 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 31/31 constraints]
After SMT, in 39279ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39281ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40783 ms. Remains : 209/209 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 12 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 15:08:35] [INFO ] Computed 31 invariants in 13 ms
[2024-05-22 15:08:35] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:08:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:08:35] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 15:08:35] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:08:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:08:35] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:08:35] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:08:35] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:08:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
TRAPS : Iteration 1
[2024-05-22 15:08:35] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:08:35] [INFO ] After 477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 547 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 15:08:36] [INFO ] Computed 49 invariants in 19 ms
[2024-05-22 15:08:36] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 15:08:36] [INFO ] Invariant cache hit.
[2024-05-22 15:08:36] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 15:08:37] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
[2024-05-22 15:08:37] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 15:08:37] [INFO ] Invariant cache hit.
[2024-05-22 15:08:37] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:08:50] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-22 15:08:50] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:08:50] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:08:50] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:08:52] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-05-22 15:08:52] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 2.0)
(s6 2.0)
(s7 1.0)
(s8 3.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 2.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 2.0)
(s39 1.0)
(s40 2.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 2.0)
(s67 2.0)
(s68 3.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 2.0)
(s97 2.0)
(s98 3.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 2.0)
(s128 2.0)
(s129 3.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 346 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/536 variables, and 597 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 258/261 constraints, Known Traps: 0/6 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61301 ms. Remains : 274/274 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (5587 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3252 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 700112 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 700112 steps, saw 350170 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
[2024-05-22 15:09:40] [INFO ] Invariant cache hit.
[2024-05-22 15:09:40] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/108 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/174 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/233 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/238 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/532 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/536 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/108 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/174 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/233 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/238 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/532 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:09:41] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:09:41] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:09:41] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/532 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/532 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/536 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/536 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/536 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/536 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 900ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 236 transition count 224
Applied a total of 116 rules in 12 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 236/274 places, 224/262 transitions.
RANDOM walk for 40000 steps (5027 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3375 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 731260 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 731260 steps, saw 365871 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
// Phase 1: matrix 224 rows 236 cols
[2024-05-22 15:09:44] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 15:09:44] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/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) 173/218 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/231 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 224/455 variables, 231/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 37/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/460 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/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) 173/218 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:09:44] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:09:45] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:09:45] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:09:45] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:09:45] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:09:45] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:09:45] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:09:45] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:09:45] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:09:45] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/231 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 224/455 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 37/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/460 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/460 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1429 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1619ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 15:09:46] [INFO ] Invariant cache hit.
[2024-05-22 15:09:46] [INFO ] Implicit Places using invariants in 286 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 151, 156, 179, 185, 192, 227, 233]
[2024-05-22 15:09:46] [INFO ] Actually due to overlaps returned [192, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 287 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 223
Applied a total of 2 rules in 8 ms. Remains 233 /234 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 233 cols
[2024-05-22 15:09:46] [INFO ] Computed 47 invariants in 11 ms
[2024-05-22 15:09:46] [INFO ] Implicit Places using invariants in 259 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 150, 155, 178, 184, 224, 230]
[2024-05-22 15:09:46] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 260 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 223/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 222
Applied a total of 2 rules in 7 ms. Remains 230 /231 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 230 cols
[2024-05-22 15:09:46] [INFO ] Computed 45 invariants in 10 ms
[2024-05-22 15:09:47] [INFO ] Implicit Places using invariants in 238 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 150, 155, 178, 184]
[2024-05-22 15:09:47] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 240 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 222/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 221
Applied a total of 2 rules in 7 ms. Remains 227 /228 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 227 cols
[2024-05-22 15:09:47] [INFO ] Computed 43 invariants in 12 ms
[2024-05-22 15:09:47] [INFO ] Implicit Places using invariants in 225 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 147, 152, 175, 181]
[2024-05-22 15:09:47] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 226 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 221/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 220
Applied a total of 2 rules in 8 ms. Remains 224 /225 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 224 cols
[2024-05-22 15:09:47] [INFO ] Computed 41 invariants in 8 ms
[2024-05-22 15:09:47] [INFO ] Implicit Places using invariants in 184 ms returned [66, 71, 91, 97, 118, 123, 144, 149, 172, 178]
[2024-05-22 15:09:47] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 185 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 220/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 219
Applied a total of 2 rules in 7 ms. Remains 221 /222 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 221 cols
[2024-05-22 15:09:47] [INFO ] Computed 39 invariants in 11 ms
[2024-05-22 15:09:47] [INFO ] Implicit Places using invariants in 179 ms returned [88, 94, 115, 120, 141, 146, 169, 175]
[2024-05-22 15:09:47] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 189 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 219/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 218
Applied a total of 2 rules in 6 ms. Remains 218 /219 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 218 cols
[2024-05-22 15:09:47] [INFO ] Computed 37 invariants in 7 ms
[2024-05-22 15:09:47] [INFO ] Implicit Places using invariants in 151 ms returned [112, 117, 138, 143, 166, 172]
[2024-05-22 15:09:47] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 218/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 217
Applied a total of 2 rules in 8 ms. Remains 215 /216 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 215 cols
[2024-05-22 15:09:47] [INFO ] Computed 35 invariants in 9 ms
[2024-05-22 15:09:48] [INFO ] Implicit Places using invariants in 147 ms returned [135, 140, 163, 169]
[2024-05-22 15:09:48] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 147 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 217/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 216
Applied a total of 2 rules in 7 ms. Remains 212 /213 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 212 cols
[2024-05-22 15:09:48] [INFO ] Computed 33 invariants in 10 ms
[2024-05-22 15:09:48] [INFO ] Implicit Places using invariants in 143 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 158 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 216/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 215
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-22 15:09:48] [INFO ] Computed 31 invariants in 14 ms
[2024-05-22 15:09:48] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 15:09:48] [INFO ] Invariant cache hit.
[2024-05-22 15:09:48] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:09:49] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 215/224 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3382 ms. Remains : 209/236 places, 215/224 transitions.
RANDOM walk for 40000 steps (5654 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3639 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 790317 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 1
Probabilistic random walk after 790317 steps, saw 395237 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2024-05-22 15:09:52] [INFO ] Invariant cache hit.
[2024-05-22 15:09:52] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/204 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 215/419 variables, 204/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 37/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/424 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:09:52] [INFO ] Deduced a trap composed of 96 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 107 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 99 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 102 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 105 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 103 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 100 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 100 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 101 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 102 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/204 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:09:53] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/419 variables, 204/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 37/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:09:54] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/424 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/424 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 1694ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 15:09:54] [INFO ] Invariant cache hit.
[2024-05-22 15:09:54] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 15:09:54] [INFO ] Invariant cache hit.
[2024-05-22 15:09:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:09:55] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2024-05-22 15:09:55] [INFO ] Redundant transitions in 1 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-22 15:09:55] [INFO ] Invariant cache hit.
[2024-05-22 15:09:55] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/424 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8936 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/424 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 214/491 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:10:15] [INFO ] Deduced a trap composed of 94 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:10:15] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:10:15] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:10:15] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:10:15] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:10:15] [INFO ] Deduced a trap composed of 98 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:10:15] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:10:15] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:10:15] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:10:16] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 10/501 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:10:21] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:10:21] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:10:21] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:10:22] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:10:22] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:10:22] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:10:22] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:10:22] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:10:22] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 2 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:10:24] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 20/521 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:10:28] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 522 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 31/31 constraints]
After SMT, in 39068ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40568 ms. Remains : 209/209 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 11 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 15:10:34] [INFO ] Computed 31 invariants in 14 ms
[2024-05-22 15:10:35] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:10:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:10:35] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:10:35] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:10:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:10:35] [INFO ] After 36ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:10:35] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 1 ms to minimize.
[2024-05-22 15:10:35] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 1 ms to minimize.
[2024-05-22 15:10:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
TRAPS : Iteration 1
[2024-05-22 15:10:35] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:10:35] [INFO ] After 592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 697 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13839 reset in 94 ms.
Product exploration explored 100000 steps with 13792 reset in 101 ms.
Built C files in :
/tmp/ltsmin8215236416423734121
[2024-05-22 15:10:36] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-22 15:10:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:10:36] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-22 15:10:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:10:36] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-22 15:10:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:10:36] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8215236416423734121
Running compilation step : cd /tmp/ltsmin8215236416423734121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 620 ms.
Running link step : cd /tmp/ltsmin8215236416423734121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8215236416423734121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10627280097310899616.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 12 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 15:10:51] [INFO ] Computed 49 invariants in 11 ms
[2024-05-22 15:10:51] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 15:10:51] [INFO ] Invariant cache hit.
[2024-05-22 15:10:51] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 15:10:52] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2024-05-22 15:10:52] [INFO ] Redundant transitions in 0 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 15:10:52] [INFO ] Invariant cache hit.
[2024-05-22 15:10:52] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:11:04] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:11:04] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:11:04] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:11:05] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:11:06] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:11:07] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/536 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 346 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/536 variables, and 597 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 258/261 constraints, Known Traps: 0/6 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61307 ms. Remains : 274/274 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin5423678865468725466
[2024-05-22 15:11:52] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-22 15:11:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:11:52] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-22 15:11:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:11:52] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-22 15:11:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:11:52] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5423678865468725466
Running compilation step : cd /tmp/ltsmin5423678865468725466;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 604 ms.
Running link step : cd /tmp/ltsmin5423678865468725466;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5423678865468725466;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5976066300710819950.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 15:12:07] [INFO ] Flatten gal took : 15 ms
[2024-05-22 15:12:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 15:12:07] [INFO ] Time to serialize gal into /tmp/LTL8414538122497245052.gal : 3 ms
[2024-05-22 15:12:07] [INFO ] Time to serialize properties into /tmp/LTL5500713801224757821.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8414538122497245052.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5579992455573074260.hoa' '-atoms' '/tmp/LTL5500713801224757821.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5500713801224757821.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5579992455573074260.hoa
Detected timeout of ITS tools.
[2024-05-22 15:12:22] [INFO ] Flatten gal took : 10 ms
[2024-05-22 15:12:22] [INFO ] Flatten gal took : 10 ms
[2024-05-22 15:12:22] [INFO ] Time to serialize gal into /tmp/LTL10216976765593965822.gal : 2 ms
[2024-05-22 15:12:22] [INFO ] Time to serialize properties into /tmp/LTL9862581366037174345.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10216976765593965822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9862581366037174345.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G("(p427<=p70)")))
Formula 0 simplified : F!"(p427<=p70)"
Detected timeout of ITS tools.
[2024-05-22 15:12:37] [INFO ] Flatten gal took : 15 ms
[2024-05-22 15:12:37] [INFO ] Applying decomposition
[2024-05-22 15:12:37] [INFO ] Flatten gal took : 10 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/graph2576336549943181954.txt' '-o' '/tmp/graph2576336549943181954.bin' '-w' '/tmp/graph2576336549943181954.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2576336549943181954.bin' '-l' '-1' '-v' '-w' '/tmp/graph2576336549943181954.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:12:37] [INFO ] Decomposing Gal with order
[2024-05-22 15:12:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:12:37] [INFO ] Removed a total of 212 redundant transitions.
[2024-05-22 15:12:37] [INFO ] Flatten gal took : 20 ms
[2024-05-22 15:12:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 11 ms.
[2024-05-22 15:12:37] [INFO ] Time to serialize gal into /tmp/LTL7621862495515136545.gal : 4 ms
[2024-05-22 15:12:37] [INFO ] Time to serialize properties into /tmp/LTL12738729258458292675.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7621862495515136545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12738729258458292675.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G("(gu101.p427<=gu101.p70)")))
Formula 0 simplified : F!"(gu101.p427<=gu101.p70)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-02 finished in 376978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 241 place count 405 transition count 356
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 495 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 496 place count 277 transition count 264
Applied a total of 496 rules in 27 ms. Remains 277 /528 variables (removed 251) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 277 cols
[2024-05-22 15:12:53] [INFO ] Computed 49 invariants in 16 ms
[2024-05-22 15:12:53] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 15:12:53] [INFO ] Invariant cache hit.
[2024-05-22 15:12:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:12:54] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2024-05-22 15:12:54] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 15:12:54] [INFO ] Invariant cache hit.
[2024-05-22 15:12:54] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/541 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 15:13:07] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 15:13:12] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:13:12] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:13:12] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:13:12] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/541 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 349 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 260/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/541 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 607 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 0/5 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in SI_LTL mode, iteration 1 : 277/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61394 ms. Remains : 277/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-03
Product exploration explored 100000 steps with 13911 reset in 133 ms.
Product exploration explored 100000 steps with 13873 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 849 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (5488 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3215 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3267 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3240 resets) in 276 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3241 resets) in 352 ms. (113 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 222843 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 4
Probabilistic random walk after 222843 steps, saw 111453 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-22 15:13:58] [INFO ] Invariant cache hit.
[2024-05-22 15:13:58] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 118/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 116/238 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/241 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 254/495 variables, 241/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 16/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 40/535 variables, 31/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/537 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/541 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/541 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/541 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/541 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 344 constraints, problems are : Problem set: 0 solved, 4 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 118/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 116/238 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/241 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 254/495 variables, 241/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 16/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 11 (OVERLAPS) 40/535 variables, 31/334 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 2/336 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 1/337 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 2/339 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 15:13:59] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:13:59] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 2/341 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/537 variables, 2/343 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 2/345 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 4/541 variables, 3/348 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/541 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/541 variables, 0/349 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/541 variables, 0/349 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 349 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1494ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23381 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 264/264 transitions.
Graph (complete) has 809 edges and 277 vertex of which 276 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 276 transition count 263
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 276 transition count 227
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 240 transition count 227
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 116 place count 240 transition count 227
Applied a total of 116 rules in 18 ms. Remains 240 /277 variables (removed 37) and now considering 227/264 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 240/277 places, 227/264 transitions.
RANDOM walk for 40000 steps (5113 resets) in 431 ms. (92 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3406 resets) in 331 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3420 resets) in 301 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3373 resets) in 629 ms. (63 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 324914 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 3
Probabilistic random walk after 324914 steps, saw 162559 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 227 rows 240 cols
[2024-05-22 15:14:26] [INFO ] Computed 49 invariants in 10 ms
[2024-05-22 15:14:26] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 152/215 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/235 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 227/462 variables, 235/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 38/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/467 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/467 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 327 constraints, problems are : Problem set: 0 solved, 3 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 240/240 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 152/215 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:14:27] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-22 15:14:27] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-22 15:14:27] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-22 15:14:27] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:14:27] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:14:27] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:14:27] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:14:27] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:14:28] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 20/235 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:14:29] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:14:29] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:14:29] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:14:29] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:14:29] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 227/462 variables, 235/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 38/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:14:29] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 5/467 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/467 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/467 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/467 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 358 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 240/240 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 28/28 constraints]
After SMT, in 3290ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11838 ms.
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 240/240 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 15:14:42] [INFO ] Invariant cache hit.
[2024-05-22 15:14:42] [INFO ] Implicit Places using invariants in 311 ms returned [20, 26, 46, 51, 74, 81, 102, 108, 130, 135, 136, 157, 162, 184, 190, 197, 231, 237]
[2024-05-22 15:14:42] [INFO ] Actually due to overlaps returned [197, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 312 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/240 places, 227/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 226
Applied a total of 2 rules in 8 ms. Remains 237 /238 variables (removed 1) and now considering 226/227 (removed 1) transitions.
// Phase 1: matrix 226 rows 237 cols
[2024-05-22 15:14:42] [INFO ] Computed 47 invariants in 9 ms
[2024-05-22 15:14:42] [INFO ] Implicit Places using invariants in 278 ms returned [20, 26, 46, 51, 74, 81, 102, 108, 130, 135, 156, 161, 183, 189, 228, 234]
[2024-05-22 15:14:42] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 283 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/240 places, 226/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 225
Applied a total of 2 rules in 14 ms. Remains 234 /235 variables (removed 1) and now considering 225/226 (removed 1) transitions.
// Phase 1: matrix 225 rows 234 cols
[2024-05-22 15:14:42] [INFO ] Computed 45 invariants in 7 ms
[2024-05-22 15:14:42] [INFO ] Implicit Places using invariants in 229 ms returned [20, 26, 46, 51, 74, 81, 102, 108, 130, 135, 156, 161, 183, 189]
[2024-05-22 15:14:42] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 230 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 232/240 places, 225/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 224
Applied a total of 2 rules in 15 ms. Remains 231 /232 variables (removed 1) and now considering 224/225 (removed 1) transitions.
// Phase 1: matrix 224 rows 231 cols
[2024-05-22 15:14:42] [INFO ] Computed 43 invariants in 13 ms
[2024-05-22 15:14:43] [INFO ] Implicit Places using invariants in 231 ms returned [43, 48, 71, 78, 99, 105, 127, 132, 153, 158, 180, 186]
[2024-05-22 15:14:43] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 232 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 229/240 places, 224/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 223
Applied a total of 2 rules in 8 ms. Remains 228 /229 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 228 cols
[2024-05-22 15:14:43] [INFO ] Computed 41 invariants in 16 ms
[2024-05-22 15:14:43] [INFO ] Implicit Places using invariants in 215 ms returned [68, 75, 96, 102, 124, 129, 150, 155, 177, 183]
[2024-05-22 15:14:43] [INFO ] Actually due to overlaps returned [75, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 216 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 226/240 places, 223/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 222
Applied a total of 2 rules in 7 ms. Remains 225 /226 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 225 cols
[2024-05-22 15:14:43] [INFO ] Computed 39 invariants in 10 ms
[2024-05-22 15:14:43] [INFO ] Implicit Places using invariants in 191 ms returned [93, 99, 121, 126, 147, 152, 174, 180]
[2024-05-22 15:14:43] [INFO ] Actually due to overlaps returned [99, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 192 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 223/240 places, 222/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 221
Applied a total of 2 rules in 7 ms. Remains 222 /223 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 222 cols
[2024-05-22 15:14:43] [INFO ] Computed 37 invariants in 12 ms
[2024-05-22 15:14:43] [INFO ] Implicit Places using invariants in 180 ms returned [118, 123, 144, 149, 171, 177]
[2024-05-22 15:14:43] [INFO ] Actually due to overlaps returned [123, 118]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 181 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 220/240 places, 221/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 220
Applied a total of 2 rules in 8 ms. Remains 219 /220 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 219 cols
[2024-05-22 15:14:43] [INFO ] Computed 35 invariants in 12 ms
[2024-05-22 15:14:43] [INFO ] Implicit Places using invariants in 173 ms returned [141, 146, 168, 174]
[2024-05-22 15:14:43] [INFO ] Actually due to overlaps returned [146, 141]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 174 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 217/240 places, 220/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 219
Applied a total of 2 rules in 8 ms. Remains 216 /217 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 216 cols
[2024-05-22 15:14:43] [INFO ] Computed 33 invariants in 12 ms
[2024-05-22 15:14:44] [INFO ] Implicit Places using invariants in 159 ms returned [165, 171]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 160 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 214/240 places, 219/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 218
Applied a total of 2 rules in 7 ms. Remains 213 /214 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 213 cols
[2024-05-22 15:14:44] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 15:14:44] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 15:14:44] [INFO ] Invariant cache hit.
[2024-05-22 15:14:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:14:45] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 213/240 places, 218/227 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3561 ms. Remains : 213/240 places, 218/227 transitions.
RANDOM walk for 40000 steps (5687 resets) in 410 ms. (97 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3598 resets) in 365 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3582 resets) in 442 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3633 resets) in 288 ms. (138 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 246634 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 3
Probabilistic random walk after 246634 steps, saw 123336 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-22 15:14:49] [INFO ] Invariant cache hit.
[2024-05-22 15:14:49] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/208 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 218/426 variables, 208/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5/431 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/431 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 282 constraints, problems are : Problem set: 0 solved, 3 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 213/213 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:14:49] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 70/208 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 218/426 variables, 208/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 38/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/431 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:14:50] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:14:50] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/431 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 288 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 213/213 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1254ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4709 ms.
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 213 /213 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 213/213 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2024-05-22 15:14:55] [INFO ] Invariant cache hit.
[2024-05-22 15:14:55] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 15:14:55] [INFO ] Invariant cache hit.
[2024-05-22 15:14:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:14:56] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
[2024-05-22 15:14:56] [INFO ] Redundant transitions in 2 ms returned []
Running 217 sub problems to find dead transitions.
[2024-05-22 15:14:56] [INFO ] Invariant cache hit.
[2024-05-22 15:14:56] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 1/213 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-22 15:14:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/431 variables, 213/245 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/431 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 283 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14498 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 213/213 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 1/213 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/431 variables, 213/245 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 217/500 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-22 15:15:20] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:15:20] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:15:20] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:15:20] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:15:20] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:15:20] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 2 ms to minimize.
[2024-05-22 15:15:20] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:15:20] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:15:20] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:15:20] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:15:21] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:15:21] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:15:21] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:15:21] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:15:21] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:15:21] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:15:22] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 17/517 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-22 15:15:30] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 518 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 213/213 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 19/19 constraints]
After SMT, in 44588ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 44592ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46052 ms. Remains : 213/213 places, 218/218 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 240 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 277 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 264/264 (removed 0) transitions.
// Phase 1: matrix 264 rows 277 cols
[2024-05-22 15:15:41] [INFO ] Computed 49 invariants in 12 ms
[2024-05-22 15:15:41] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 15:15:41] [INFO ] Invariant cache hit.
[2024-05-22 15:15:41] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:15:42] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
[2024-05-22 15:15:42] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 15:15:42] [INFO ] Invariant cache hit.
[2024-05-22 15:15:42] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/541 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 15:15:55] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 15:16:01] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:16:01] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:16:01] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:16:01] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/541 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 349 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 260/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/541 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 607 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 0/5 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61313 ms. Remains : 277/277 places, 264/264 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 849 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (5569 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3270 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 692377 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 1
Probabilistic random walk after 692377 steps, saw 346299 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2024-05-22 15:16:46] [INFO ] Invariant cache hit.
[2024-05-22 15:16:46] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/34 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/128 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 109/237 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 29/266 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 233/499 variables, 234/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 16/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/499 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 36/535 variables, 27/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/535 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/537 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/537 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/541 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/541 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/541 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/34 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 94/128 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 109/237 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/266 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:16:46] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 233/499 variables, 234/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/499 variables, 16/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/499 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 36/535 variables, 27/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:16:46] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:16:46] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:16:46] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:16:46] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/537 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/537 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/537 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/541 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/541 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/541 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/541 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 923ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 264/264 transitions.
Graph (complete) has 809 edges and 277 vertex of which 276 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 276 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 276 transition count 262
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 275 transition count 262
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 6 place count 274 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8 place count 273 transition count 261
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 44 place count 273 transition count 225
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 80 place count 237 transition count 225
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 2 with 41 rules applied. Total rules applied 121 place count 237 transition count 225
Applied a total of 121 rules in 17 ms. Remains 237 /277 variables (removed 40) and now considering 225/264 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 237/277 places, 225/264 transitions.
RANDOM walk for 40000 steps (5051 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3382 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 732310 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 1
Probabilistic random walk after 732310 steps, saw 366395 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
// Phase 1: matrix 225 rows 237 cols
[2024-05-22 15:16:50] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 15:16:50] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/228 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/232 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 225/457 variables, 232/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 38/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/462 variables, 5/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 237/237 constraints, ReadFeed: 38/38 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/228 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:16:50] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2024-05-22 15:16:50] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:16:50] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-22 15:16:50] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:16:50] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:16:51] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:16:52] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:16:52] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:16:52] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:16:52] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:16:52] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:16:52] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/232 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 225/457 variables, 232/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 38/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/462 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/462 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 347 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2410 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 237/237 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 2589ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 237/237 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-22 15:16:52] [INFO ] Invariant cache hit.
[2024-05-22 15:16:53] [INFO ] Implicit Places using invariants in 289 ms returned [20, 26, 46, 51, 74, 79, 100, 106, 128, 133, 134, 154, 159, 181, 187, 194, 228, 234]
[2024-05-22 15:16:53] [INFO ] Actually due to overlaps returned [194, 133]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 289 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/237 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 224
Applied a total of 2 rules in 8 ms. Remains 234 /235 variables (removed 1) and now considering 224/225 (removed 1) transitions.
// Phase 1: matrix 224 rows 234 cols
[2024-05-22 15:16:53] [INFO ] Computed 47 invariants in 11 ms
[2024-05-22 15:16:53] [INFO ] Implicit Places using invariants in 261 ms returned [20, 26, 46, 51, 74, 79, 100, 106, 128, 133, 153, 158, 180, 186, 225, 231]
[2024-05-22 15:16:53] [INFO ] Actually due to overlaps returned [231, 225]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 262 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 232/237 places, 224/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Applied a total of 2 rules in 6 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-05-22 15:16:53] [INFO ] Computed 45 invariants in 16 ms
[2024-05-22 15:16:53] [INFO ] Implicit Places using invariants in 261 ms returned [20, 26, 46, 51, 74, 79, 100, 106, 128, 133, 153, 158, 180, 186]
[2024-05-22 15:16:53] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 262 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 229/237 places, 223/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 222
Applied a total of 2 rules in 6 ms. Remains 228 /229 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 228 cols
[2024-05-22 15:16:53] [INFO ] Computed 43 invariants in 8 ms
[2024-05-22 15:16:53] [INFO ] Implicit Places using invariants in 212 ms returned [43, 48, 71, 76, 97, 103, 125, 130, 150, 155, 177, 183]
[2024-05-22 15:16:53] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 213 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 226/237 places, 222/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 221
Applied a total of 2 rules in 9 ms. Remains 225 /226 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 225 cols
[2024-05-22 15:16:53] [INFO ] Computed 41 invariants in 15 ms
[2024-05-22 15:16:54] [INFO ] Implicit Places using invariants in 202 ms returned [68, 73, 94, 100, 122, 127, 147, 152, 174, 180]
[2024-05-22 15:16:54] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 205 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 223/237 places, 221/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 220
Applied a total of 2 rules in 7 ms. Remains 222 /223 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 222 cols
[2024-05-22 15:16:54] [INFO ] Computed 39 invariants in 15 ms
[2024-05-22 15:16:54] [INFO ] Implicit Places using invariants in 183 ms returned [91, 97, 119, 124, 144, 149, 171, 177]
[2024-05-22 15:16:54] [INFO ] Actually due to overlaps returned [97, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 183 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 220/237 places, 220/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 219
Applied a total of 2 rules in 7 ms. Remains 219 /220 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 219 cols
[2024-05-22 15:16:54] [INFO ] Computed 37 invariants in 11 ms
[2024-05-22 15:16:54] [INFO ] Implicit Places using invariants in 158 ms returned [116, 121, 141, 146, 168, 174]
[2024-05-22 15:16:54] [INFO ] Actually due to overlaps returned [121, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 159 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 217/237 places, 219/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 6 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-22 15:16:54] [INFO ] Computed 35 invariants in 9 ms
[2024-05-22 15:16:54] [INFO ] Implicit Places using invariants in 151 ms returned [138, 143, 165, 171]
[2024-05-22 15:16:54] [INFO ] Actually due to overlaps returned [143, 138]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 214/237 places, 218/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 8 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 213 cols
[2024-05-22 15:16:54] [INFO ] Computed 33 invariants in 11 ms
[2024-05-22 15:16:54] [INFO ] Implicit Places using invariants in 151 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 211/237 places, 217/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 7 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 15:16:54] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 15:16:54] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 15:16:54] [INFO ] Invariant cache hit.
[2024-05-22 15:16:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:16:56] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 210/237 places, 216/225 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3420 ms. Remains : 210/237 places, 216/225 transitions.
RANDOM walk for 40000 steps (5711 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3576 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Probably explored full state space saw : 264449 states, properties seen :0
Probabilistic random walk after 528905 steps, saw 264449 distinct states, run finished after 2018 ms. (steps per millisecond=262 ) properties seen :0
Interrupted probabilistic random walk after 786096 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 1
Exhaustive walk after 786096 steps, saw 393131 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
[2024-05-22 15:17:01] [INFO ] Invariant cache hit.
[2024-05-22 15:17:01] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/205 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/421 variables, 205/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 38/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/426 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 38/38 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:17:01] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/205 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 216/421 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 38/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/426 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 15:17:01] [INFO ] Invariant cache hit.
[2024-05-22 15:17:02] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 15:17:02] [INFO ] Invariant cache hit.
[2024-05-22 15:17:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:17:03] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
[2024-05-22 15:17:03] [INFO ] Redundant transitions in 2 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 15:17:03] [INFO ] Invariant cache hit.
[2024-05-22 15:17:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 279 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9481 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:17:13] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/426 variables, 210/242 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 38/280 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 215/495 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:17:22] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:17:25] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:17:25] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:17:30] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 499 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
After SMT, in 39601ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39606ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41041 ms. Remains : 210/210 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 180 transition count 186
Applied a total of 60 rules in 11 ms. Remains 180 /210 variables (removed 30) and now considering 186/216 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 15:17:42] [INFO ] Computed 31 invariants in 13 ms
[2024-05-22 15:17:42] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:17:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-22 15:17:43] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:17:43] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:17:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:17:43] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:17:43] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:17:43] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 230 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13871 reset in 91 ms.
Product exploration explored 100000 steps with 13810 reset in 112 ms.
Built C files in :
/tmp/ltsmin12513041357354309633
[2024-05-22 15:17:43] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2024-05-22 15:17:43] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:17:43] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2024-05-22 15:17:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:17:43] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2024-05-22 15:17:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:17:43] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12513041357354309633
Running compilation step : cd /tmp/ltsmin12513041357354309633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 610 ms.
Running link step : cd /tmp/ltsmin12513041357354309633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12513041357354309633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5083823407932698851.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 264/264 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 277 transition count 263
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 2 place count 276 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 6 place count 274 transition count 262
Applied a total of 6 rules in 19 ms. Remains 274 /277 variables (removed 3) and now considering 262/264 (removed 2) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 15:17:58] [INFO ] Computed 49 invariants in 12 ms
[2024-05-22 15:17:59] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 15:17:59] [INFO ] Invariant cache hit.
[2024-05-22 15:17:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:17:59] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2024-05-22 15:18:00] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 15:18:00] [INFO ] Invariant cache hit.
[2024-05-22 15:18:00] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:18:12] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:18:12] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:18:12] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:18:12] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:18:12] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:18:13] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 2 ms to minimize.
[2024-05-22 15:18:13] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:18:13] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:18:13] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:18:14] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:18:14] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:18:14] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:18:15] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:18:15] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 14/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:18:19] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:18:19] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:18:20] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-05-22 15:18:20] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:18:29] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 360 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60058ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/277 places, 262/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61224 ms. Remains : 274/277 places, 262/264 transitions.
Built C files in :
/tmp/ltsmin366153843417285632
[2024-05-22 15:19:00] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-22 15:19:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:19:00] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-22 15:19:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:19:00] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-22 15:19:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:19:00] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin366153843417285632
Running compilation step : cd /tmp/ltsmin366153843417285632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 645 ms.
Running link step : cd /tmp/ltsmin366153843417285632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin366153843417285632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15332777336677694218.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 15:19:15] [INFO ] Flatten gal took : 10 ms
[2024-05-22 15:19:15] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:19:15] [INFO ] Time to serialize gal into /tmp/LTL14183937433331496342.gal : 2 ms
[2024-05-22 15:19:15] [INFO ] Time to serialize properties into /tmp/LTL11673819362162789762.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14183937433331496342.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11525458005127654961.hoa' '-atoms' '/tmp/LTL11673819362162789762.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11673819362162789762.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11525458005127654961.hoa
Detected timeout of ITS tools.
[2024-05-22 15:19:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:19:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:19:30] [INFO ] Time to serialize gal into /tmp/LTL15146622560870967700.gal : 2 ms
[2024-05-22 15:19:30] [INFO ] Time to serialize properties into /tmp/LTL8855047926148358260.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15146622560870967700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8855047926148358260.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p382<=p245)")U("(p227<=p284)")))))
Formula 0 simplified : GF(!"(p382<=p245)" R !"(p227<=p284)")
Detected timeout of ITS tools.
[2024-05-22 15:19:45] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:19:45] [INFO ] Applying decomposition
[2024-05-22 15:19:45] [INFO ] Flatten gal took : 8 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/graph11993663127702795932.txt' '-o' '/tmp/graph11993663127702795932.bin' '-w' '/tmp/graph11993663127702795932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11993663127702795932.bin' '-l' '-1' '-v' '-w' '/tmp/graph11993663127702795932.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:19:45] [INFO ] Decomposing Gal with order
[2024-05-22 15:19:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:19:45] [INFO ] Removed a total of 206 redundant transitions.
[2024-05-22 15:19:45] [INFO ] Flatten gal took : 18 ms
[2024-05-22 15:19:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2024-05-22 15:19:45] [INFO ] Time to serialize gal into /tmp/LTL143824028182278672.gal : 3 ms
[2024-05-22 15:19:45] [INFO ] Time to serialize properties into /tmp/LTL10441843774766451032.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL143824028182278672.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10441843774766451032.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu69.p382<=gu69.p245)")U("(gu31.p227<=gu31.p284)")))))
Formula 0 simplified : GF(!"(gu69.p382<=gu69.p245)" R !"(gu31.p227<=gu31.p284)")
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-03 finished in 427500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(p0)))&&F(p1))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 9 ms. Remains 527 /528 variables (removed 1) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-22 15:20:00] [INFO ] Computed 49 invariants in 23 ms
[2024-05-22 15:20:00] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 15:20:00] [INFO ] Invariant cache hit.
[2024-05-22 15:20:02] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 15:20:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 15:20:17] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-22 15:20:18] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 578 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1074 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1074 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62032 ms. Remains : 527/528 places, 497/497 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 190 ms.
Product exploration explored 100000 steps with 25000 reset in 138 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1302 resets) in 101 ms. (392 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (1135 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1118 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
[2024-05-22 15:21:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/71 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 115/186 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 73/259 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 47/306 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 47/353 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 47/400 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/434 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 16/450 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/450 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 471/921 variables, 450/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/921 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 89/1010 variables, 69/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:21:04] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1010 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1010 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 8/1018 variables, 4/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1018 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 5/1023 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1023 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 30 (OVERLAPS) 1/1024 variables, 1/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 15:21:04] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1024 variables, 1/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1024 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1024 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 578 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/73 variables, 6/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/178 variables, 9/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 120/298 variables, 13/29 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 15:21:04] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/304 variables, 2/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 49/353 variables, 7/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 47/400 variables, 5/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 34/434 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/434 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/450 variables, 2/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 471/921 variables, 450/500 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/921 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 89/1010 variables, 69/569 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1010 variables, 1/570 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1010 variables, 2/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1010 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 8/1018 variables, 4/576 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1018 variables, 0/576 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 5/1023 variables, 3/579 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1023 variables, 0/579 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/1024 variables, 1/580 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 15:21:05] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-05-22 15:21:05] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2024-05-22 15:21:05] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-05-22 15:21:05] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1024 variables, 4/584 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1024 variables, 0/584 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1024 variables, 0/584 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 584 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2309ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 139 ms.
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 244 place count 404 transition count 353
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 472 place count 290 transition count 260
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 508 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 545 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 582 place count 235 transition count 223
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 622 place count 235 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 234 transition count 222
Applied a total of 623 rules in 35 ms. Remains 234 /527 variables (removed 293) and now considering 222/497 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 234/527 places, 222/497 transitions.
RANDOM walk for 40000 steps (5171 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3385 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 732157 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 732157 steps, saw 366325 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
// Phase 1: matrix 222 rows 234 cols
[2024-05-22 15:21:09] [INFO ] Computed 49 invariants in 13 ms
[2024-05-22 15:21:09] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:21:09] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/226 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:21:09] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:21:09] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:21:09] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:21:09] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:21:09] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:21:09] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/229 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/451 variables, 229/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 38/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/456 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/456 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/456 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/226 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:21:10] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/229 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:21:11] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 222/451 variables, 229/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 38/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:21:11] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/451 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/456 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/456 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/456 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/456 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1509 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 2324ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-22 15:21:11] [INFO ] Invariant cache hit.
[2024-05-22 15:21:11] [INFO ] Implicit Places using invariants in 284 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
[2024-05-22 15:21:11] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 285 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 221
Applied a total of 2 rules in 7 ms. Remains 231 /232 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 231 cols
[2024-05-22 15:21:11] [INFO ] Computed 47 invariants in 15 ms
[2024-05-22 15:21:12] [INFO ] Implicit Places using invariants in 262 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183, 222, 228]
[2024-05-22 15:21:12] [INFO ] Actually due to overlaps returned [228, 222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 262 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 229/234 places, 221/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 220
Applied a total of 2 rules in 8 ms. Remains 228 /229 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 228 cols
[2024-05-22 15:21:12] [INFO ] Computed 45 invariants in 12 ms
[2024-05-22 15:21:12] [INFO ] Implicit Places using invariants in 229 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183]
[2024-05-22 15:21:12] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 230 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 226/234 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 219
Applied a total of 2 rules in 11 ms. Remains 225 /226 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 225 cols
[2024-05-22 15:21:12] [INFO ] Computed 43 invariants in 8 ms
[2024-05-22 15:21:12] [INFO ] Implicit Places using invariants in 206 ms returned [44, 49, 70, 75, 95, 101, 122, 127, 147, 152, 174, 180]
[2024-05-22 15:21:12] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 207 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 223/234 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 6 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 222 cols
[2024-05-22 15:21:12] [INFO ] Computed 41 invariants in 10 ms
[2024-05-22 15:21:12] [INFO ] Implicit Places using invariants in 189 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 171, 177]
[2024-05-22 15:21:12] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 189 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 220/234 places, 218/222 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 6 ms. Remains 220 /220 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 220 cols
[2024-05-22 15:21:12] [INFO ] Computed 39 invariants in 7 ms
[2024-05-22 15:21:12] [INFO ] Implicit Places using invariants in 169 ms returned [90, 96, 117, 122, 142, 147, 169, 175]
[2024-05-22 15:21:12] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 170 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 218/234 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 21 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 217 cols
[2024-05-22 15:21:13] [INFO ] Computed 37 invariants in 25 ms
[2024-05-22 15:21:13] [INFO ] Implicit Places using invariants in 179 ms returned [114, 119, 139, 144, 166, 172]
[2024-05-22 15:21:13] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 185 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 215/234 places, 217/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 6 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 214 cols
[2024-05-22 15:21:13] [INFO ] Computed 35 invariants in 12 ms
[2024-05-22 15:21:13] [INFO ] Implicit Places using invariants in 148 ms returned [136, 141, 163, 169]
[2024-05-22 15:21:13] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 149 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 212/234 places, 216/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 9 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 211 cols
[2024-05-22 15:21:13] [INFO ] Computed 33 invariants in 12 ms
[2024-05-22 15:21:13] [INFO ] Implicit Places using invariants in 151 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 151 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 209/234 places, 215/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 7 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-22 15:21:13] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 15:21:13] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 15:21:13] [INFO ] Invariant cache hit.
[2024-05-22 15:21:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:21:14] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 208/234 places, 214/222 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3390 ms. Remains : 208/234 places, 214/222 transitions.
RANDOM walk for 40000 steps (5704 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3686 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 800073 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 800073 steps, saw 400127 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2024-05-22 15:21:18] [INFO ] Invariant cache hit.
[2024-05-22 15:21:18] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:21:18] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/149 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:21:18] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:21:18] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:21:18] [INFO ] Deduced a trap composed of 95 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:21:18] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/203 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/422 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 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) 124/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/149 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:21:18] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:21:18] [INFO ] Deduced a trap composed of 93 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:21:18] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/203 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/417 variables, 203/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:21:19] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:21:19] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/422 variables, 5/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/422 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 288 constraints, problems are : Problem set: 0 solved, 1 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1130ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 15:21:19] [INFO ] Invariant cache hit.
[2024-05-22 15:21:19] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 15:21:19] [INFO ] Invariant cache hit.
[2024-05-22 15:21:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:21:20] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2024-05-22 15:21:20] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 15:21:20] [INFO ] Invariant cache hit.
[2024-05-22 15:21:20] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 277 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9614 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/490 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:21:36] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:21:37] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:21:37] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:21:37] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:21:37] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:21:39] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:21:40] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:21:40] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:21:40] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 2 ms to minimize.
[2024-05-22 15:21:40] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:21:41] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-22 15:21:41] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 12/502 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:21:47] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:21:47] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:21:47] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:21:47] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:21:48] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:21:48] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:21:48] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:21:48] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:21:48] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:21:48] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-05-22 15:21:48] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:21:48] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:21:48] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 13/515 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 515 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 25/25 constraints]
After SMT, in 39708ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39714ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41257 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 10 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-22 15:22:00] [INFO ] Computed 31 invariants in 15 ms
[2024-05-22 15:22:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 15:22:00] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:22:00] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 15:22:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:22:00] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:22:00] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 15:22:00] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 177 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 11 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-22 15:22:01] [INFO ] Computed 49 invariants in 22 ms
[2024-05-22 15:22:01] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 15:22:01] [INFO ] Invariant cache hit.
[2024-05-22 15:22:02] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 1744 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 15:22:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 15:22:17] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-22 15:22:18] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 578 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1074 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1074 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 2/2 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Finished structural reductions in LTL mode , in 1 iterations and 61852 ms. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 161 steps (3 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 526 transition count 496
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 118 place count 526 transition count 515
Deduced a syphon composed of 139 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 140 place count 526 transition count 515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 144 place count 522 transition count 511
Deduced a syphon composed of 135 places in 2 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 148 place count 522 transition count 511
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 228 places in 2 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 241 place count 522 transition count 531
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 242 place count 521 transition count 530
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 243 place count 521 transition count 530
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -121
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 263 place count 521 transition count 651
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 284 place count 500 transition count 609
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 305 place count 500 transition count 609
Deduced a syphon composed of 226 places in 1 ms
Applied a total of 305 rules in 133 ms. Remains 500 /527 variables (removed 27) and now considering 609/497 (removed -112) transitions.
[2024-05-22 15:23:04] [INFO ] Redundant transitions in 3 ms returned []
Running 608 sub problems to find dead transitions.
// Phase 1: matrix 609 rows 500 cols
[2024-05-22 15:23:04] [INFO ] Computed 49 invariants in 29 ms
[2024-05-22 15:23:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-22 15:23:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-22 15:23:21] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD357 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 2/51 constraints. Problems are: Problem set: 1 solved, 607 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 607 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
At refinement iteration 6 (OVERLAPS) 609/1109 variables, 500/551 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1109 variables, 20/571 constraints. Problems are: Problem set: 347 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 571 constraints, problems are : Problem set: 347 solved, 261 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 500/500 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 347 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 11/284 variables, 2/2 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 2/4 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/4 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 172/456 variables, 47/51 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/51 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 609/1065 variables, 456/507 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1065 variables, 20/527 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1065 variables, 261/788 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1065 variables, 0/788 constraints. Problems are: Problem set: 347 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 44/1109 variables, 44/832 constraints. Problems are: Problem set: 347 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 832 constraints, problems are : Problem set: 347 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 500/500 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/608 constraints, Known Traps: 2/2 constraints]
After SMT, in 60157ms problems are : Problem set: 347 solved, 261 unsolved
Search for dead transitions found 347 dead transitions in 60163ms
Found 347 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 347 transitions
Dead transitions reduction (with SMT) removed 347 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 500/527 places, 262/497 transitions.
Graph (complete) has 853 edges and 500 vertex of which 274 are kept as prefixes of interest. Removing 226 places using SCC suffix rule.1 ms
Discarding 226 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 274 /500 variables (removed 226) and now considering 262/262 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 274/527 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60317 ms. Remains : 274/527 places, 262/497 transitions.
Built C files in :
/tmp/ltsmin15196595788619191752
[2024-05-22 15:24:04] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15196595788619191752
Running compilation step : cd /tmp/ltsmin15196595788619191752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 866 ms.
Running link step : cd /tmp/ltsmin15196595788619191752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15196595788619191752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9617046115558866851.hoa' '--buchi-type=spotba'
LTSmin run took 260 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-010-LTLCardinality-04 finished in 245136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 405 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 243 place count 404 transition count 354
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 467 place count 292 transition count 262
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 503 place count 274 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 504 place count 273 transition count 261
Applied a total of 504 rules in 32 ms. Remains 273 /528 variables (removed 255) and now considering 261/497 (removed 236) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-22 15:24:05] [INFO ] Computed 49 invariants in 11 ms
[2024-05-22 15:24:05] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 15:24:05] [INFO ] Invariant cache hit.
[2024-05-22 15:24:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:24:06] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2024-05-22 15:24:06] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 15:24:06] [INFO ] Invariant cache hit.
[2024-05-22 15:24:06] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:24:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:24:19] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:24:19] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:24:20] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2024-05-22 15:24:20] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:24:22] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:24:23] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:24:23] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:24:23] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:24:24] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 5/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 350 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 600 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/10 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/528 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61380 ms. Remains : 273/528 places, 261/497 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-05
Product exploration explored 100000 steps with 13972 reset in 94 ms.
Product exploration explored 100000 steps with 13870 reset in 103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5568 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3280 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 690125 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 1
Probabilistic random walk after 690125 steps, saw 345176 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
[2024-05-22 15:25:10] [INFO ] Invariant cache hit.
[2024-05-22 15:25:10] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/231 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/236 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 251/487 variables, 236/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 16/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 41/528 variables, 32/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/530 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/534 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/231 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/236 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:25:10] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 251/487 variables, 236/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 16/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/528 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/528 variables, 7/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/528 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/530 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/534 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/534 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:25:11] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/534 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/534 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/534 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 352 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1382ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 644 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 811 edges and 273 vertex of which 272 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 235 transition count 223
Applied a total of 115 rules in 15 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 235/273 places, 223/261 transitions.
RANDOM walk for 40000 steps (5117 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3381 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 718303 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 1
Probabilistic random walk after 718303 steps, saw 359362 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
// Phase 1: matrix 223 rows 235 cols
[2024-05-22 15:25:15] [INFO ] Computed 49 invariants in 19 ms
[2024-05-22 15:25:15] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/209 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/230 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/453 variables, 230/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 37/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/458 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/209 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:25:15] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:25:15] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:25:16] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:25:17] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:25:17] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/230 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:25:17] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-22 15:25:17] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/453 variables, 230/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 37/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/458 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/458 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2129ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 15:25:17] [INFO ] Invariant cache hit.
[2024-05-22 15:25:18] [INFO ] Implicit Places using invariants in 287 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
[2024-05-22 15:25:18] [INFO ] Actually due to overlaps returned [192, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 290 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 222
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 232 cols
[2024-05-22 15:25:18] [INFO ] Computed 47 invariants in 14 ms
[2024-05-22 15:25:18] [INFO ] Implicit Places using invariants in 263 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 151, 156, 178, 184, 223, 229]
[2024-05-22 15:25:18] [INFO ] Actually due to overlaps returned [229, 223]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 264 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 230/235 places, 222/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 221
Applied a total of 2 rules in 7 ms. Remains 229 /230 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 229 cols
[2024-05-22 15:25:18] [INFO ] Computed 45 invariants in 11 ms
[2024-05-22 15:25:18] [INFO ] Implicit Places using invariants in 231 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 151, 156, 178, 184]
[2024-05-22 15:25:18] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 232 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 227/235 places, 221/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 226 transition count 220
Applied a total of 2 rules in 7 ms. Remains 226 /227 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 226 cols
[2024-05-22 15:25:18] [INFO ] Computed 43 invariants in 13 ms
[2024-05-22 15:25:18] [INFO ] Implicit Places using invariants in 212 ms returned [44, 49, 70, 75, 95, 101, 123, 128, 148, 153, 175, 181]
[2024-05-22 15:25:18] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 213 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 224/235 places, 220/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 219
Applied a total of 2 rules in 7 ms. Remains 223 /224 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 223 cols
[2024-05-22 15:25:18] [INFO ] Computed 41 invariants in 11 ms
[2024-05-22 15:25:19] [INFO ] Implicit Places using invariants in 192 ms returned [67, 72, 92, 98, 120, 125, 145, 150, 172, 178]
[2024-05-22 15:25:19] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 203 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 221/235 places, 219/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 6 ms. Remains 220 /221 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 220 cols
[2024-05-22 15:25:19] [INFO ] Computed 39 invariants in 9 ms
[2024-05-22 15:25:19] [INFO ] Implicit Places using invariants in 175 ms returned [89, 95, 117, 122, 142, 147, 169, 175]
[2024-05-22 15:25:19] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 185 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 218/235 places, 218/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 6 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 217 cols
[2024-05-22 15:25:19] [INFO ] Computed 37 invariants in 10 ms
[2024-05-22 15:25:19] [INFO ] Implicit Places using invariants in 174 ms returned [114, 119, 139, 144, 166, 172]
[2024-05-22 15:25:19] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 180 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 215/235 places, 217/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 5 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 214 cols
[2024-05-22 15:25:19] [INFO ] Computed 35 invariants in 8 ms
[2024-05-22 15:25:19] [INFO ] Implicit Places using invariants in 163 ms returned [136, 141, 163, 169]
[2024-05-22 15:25:19] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 163 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 212/235 places, 216/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 6 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 211 cols
[2024-05-22 15:25:19] [INFO ] Computed 33 invariants in 10 ms
[2024-05-22 15:25:19] [INFO ] Implicit Places using invariants in 139 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 139 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 209/235 places, 215/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-22 15:25:19] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 15:25:19] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 15:25:19] [INFO ] Invariant cache hit.
[2024-05-22 15:25:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:25:20] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 208/235 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3146 ms. Remains : 208/235 places, 214/223 transitions.
RANDOM walk for 40000 steps (5772 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3582 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 777824 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 777824 steps, saw 388994 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2024-05-22 15:25:24] [INFO ] Invariant cache hit.
[2024-05-22 15:25:24] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/149 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/203 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/417 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 37/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/422 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:25:24] [INFO ] Deduced a trap composed of 101 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/149 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/203 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:25:24] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:25:24] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-22 15:25:24] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 37/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:25:24] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/422 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 830ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 15:25:25] [INFO ] Invariant cache hit.
[2024-05-22 15:25:25] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 15:25:25] [INFO ] Invariant cache hit.
[2024-05-22 15:25:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:25:26] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2024-05-22 15:25:26] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 15:25:26] [INFO ] Invariant cache hit.
[2024-05-22 15:25:26] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 37/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 276 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9547 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 37/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:25:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 15:25:43] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:25:44] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:25:44] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:25:44] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:25:47] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:25:47] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:25:47] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:25:48] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:25:48] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:25:48] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:25:48] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:25:48] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 13/502 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:25:55] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:25:55] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:25:55] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 90 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 96 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:25:56] [INFO ] Deduced a trap composed of 98 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:25:57] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:25:57] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:25:57] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:25:57] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 20/522 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:26:00] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:26:00] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:26:01] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:26:01] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-22 15:26:01] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:26:01] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:26:01] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:26:01] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:26:01] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:26:01] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:26:01] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:26:02] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:26:02] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:26:02] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 536 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 47/47 constraints]
After SMT, in 39632ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39634ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40795 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 182 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 12 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-22 15:26:05] [INFO ] Computed 31 invariants in 7 ms
[2024-05-22 15:26:05] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:26:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 15:26:05] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-22 15:26:06] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:26:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:26:06] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:26:06] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:26:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 1
[2024-05-22 15:26:06] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:26:06] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 312 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-22 15:26:06] [INFO ] Computed 49 invariants in 8 ms
[2024-05-22 15:26:06] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-22 15:26:06] [INFO ] Invariant cache hit.
[2024-05-22 15:26:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:26:07] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
[2024-05-22 15:26:07] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 15:26:07] [INFO ] Invariant cache hit.
[2024-05-22 15:26:07] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2024-05-22 15:26:20] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:26:23] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:26:23] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:26:24] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:26:24] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:26:25] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 5/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 350 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 600 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/10 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61247 ms. Remains : 273/273 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5574 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3251 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 681844 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :0 out of 1
Probabilistic random walk after 681844 steps, saw 341033 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
[2024-05-22 15:27:10] [INFO ] Invariant cache hit.
[2024-05-22 15:27:10] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/231 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/236 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 251/487 variables, 236/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 16/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 41/528 variables, 32/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/530 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/534 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/231 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/236 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:27:10] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 251/487 variables, 236/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 16/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/528 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:27:11] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-22 15:27:11] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:27:11] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:27:11] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:27:11] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-22 15:27:11] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:27:11] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/528 variables, 7/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/528 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/530 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/534 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/534 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:27:11] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:27:11] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:27:11] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/534 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/534 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/534 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 352 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1337ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 638 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 811 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 235 transition count 223
Applied a total of 115 rules in 11 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 235/273 places, 223/261 transitions.
RANDOM walk for 40000 steps (5109 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3422 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 716412 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 1
Probabilistic random walk after 716412 steps, saw 358419 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
// Phase 1: matrix 223 rows 235 cols
[2024-05-22 15:27:15] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 15:27:15] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/209 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/230 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/453 variables, 230/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 37/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/458 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/209 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:27:15] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:27:16] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:27:17] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:27:17] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:27:17] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/230 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:27:17] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:27:17] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/453 variables, 230/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 37/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/458 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/458 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1889 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2069ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 170 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 15:27:17] [INFO ] Invariant cache hit.
[2024-05-22 15:27:18] [INFO ] Implicit Places using invariants in 290 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
[2024-05-22 15:27:18] [INFO ] Actually due to overlaps returned [192, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 290 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 222
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 232 cols
[2024-05-22 15:27:18] [INFO ] Computed 47 invariants in 13 ms
[2024-05-22 15:27:18] [INFO ] Implicit Places using invariants in 267 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 151, 156, 178, 184, 223, 229]
[2024-05-22 15:27:18] [INFO ] Actually due to overlaps returned [229, 223]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 268 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 230/235 places, 222/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 221
Applied a total of 2 rules in 7 ms. Remains 229 /230 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 229 cols
[2024-05-22 15:27:18] [INFO ] Computed 45 invariants in 13 ms
[2024-05-22 15:27:18] [INFO ] Implicit Places using invariants in 237 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 151, 156, 178, 184]
[2024-05-22 15:27:18] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 239 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 227/235 places, 221/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 226 transition count 220
Applied a total of 2 rules in 6 ms. Remains 226 /227 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 226 cols
[2024-05-22 15:27:18] [INFO ] Computed 43 invariants in 10 ms
[2024-05-22 15:27:18] [INFO ] Implicit Places using invariants in 207 ms returned [44, 49, 70, 75, 95, 101, 123, 128, 148, 153, 175, 181]
[2024-05-22 15:27:18] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 208 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 224/235 places, 220/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 219
Applied a total of 2 rules in 6 ms. Remains 223 /224 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 223 cols
[2024-05-22 15:27:18] [INFO ] Computed 41 invariants in 7 ms
[2024-05-22 15:27:19] [INFO ] Implicit Places using invariants in 187 ms returned [67, 72, 92, 98, 120, 125, 145, 150, 172, 178]
[2024-05-22 15:27:19] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 187 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 221/235 places, 219/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 6 ms. Remains 220 /221 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 220 cols
[2024-05-22 15:27:19] [INFO ] Computed 39 invariants in 9 ms
[2024-05-22 15:27:19] [INFO ] Implicit Places using invariants in 169 ms returned [89, 95, 117, 122, 142, 147, 169, 175]
[2024-05-22 15:27:19] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 169 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 218/235 places, 218/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 6 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 217 cols
[2024-05-22 15:27:19] [INFO ] Computed 37 invariants in 10 ms
[2024-05-22 15:27:19] [INFO ] Implicit Places using invariants in 174 ms returned [114, 119, 139, 144, 166, 172]
[2024-05-22 15:27:19] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 174 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 215/235 places, 217/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 8 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 214 cols
[2024-05-22 15:27:19] [INFO ] Computed 35 invariants in 8 ms
[2024-05-22 15:27:19] [INFO ] Implicit Places using invariants in 148 ms returned [136, 141, 163, 169]
[2024-05-22 15:27:19] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 149 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 212/235 places, 216/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 6 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 211 cols
[2024-05-22 15:27:19] [INFO ] Computed 33 invariants in 9 ms
[2024-05-22 15:27:19] [INFO ] Implicit Places using invariants in 144 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 209/235 places, 215/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-22 15:27:19] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 15:27:19] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 15:27:19] [INFO ] Invariant cache hit.
[2024-05-22 15:27:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:27:21] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 208/235 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3133 ms. Remains : 208/235 places, 214/223 transitions.
RANDOM walk for 40000 steps (5686 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3586 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 791186 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 1
Probabilistic random walk after 791186 steps, saw 395673 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2024-05-22 15:27:24] [INFO ] Invariant cache hit.
[2024-05-22 15:27:24] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/149 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/203 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/417 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 37/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/422 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 101 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/149 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/203 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 37/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:27:24] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/422 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 810ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 15:27:25] [INFO ] Invariant cache hit.
[2024-05-22 15:27:25] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 15:27:25] [INFO ] Invariant cache hit.
[2024-05-22 15:27:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:27:26] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2024-05-22 15:27:26] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 15:27:26] [INFO ] Invariant cache hit.
[2024-05-22 15:27:26] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 37/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 276 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9335 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 37/276 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/489 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:27:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-22 15:27:43] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-22 15:27:44] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:27:44] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:27:44] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:27:47] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:27:47] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:27:47] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:27:47] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:27:48] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:27:48] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:27:48] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:27:48] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 13/502 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:27:55] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:27:55] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:27:55] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:27:55] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:27:55] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:27:55] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:27:55] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 96 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 98 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:27:56] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:27:57] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 20/522 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:28:00] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:28:00] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-22 15:28:00] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:28:00] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:28:01] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:28:01] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-05-22 15:28:01] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:28:01] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:28:01] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:28:01] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:28:01] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:28:01] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:28:01] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:28:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 536 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 47/47 constraints]
After SMT, in 39436ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39439ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40671 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 182 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 9 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-22 15:28:05] [INFO ] Computed 31 invariants in 12 ms
[2024-05-22 15:28:05] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:28:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 15:28:05] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2024-05-22 15:28:05] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:28:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:28:05] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:28:05] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 1
[2024-05-22 15:28:06] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:28:06] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 310 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13848 reset in 87 ms.
Product exploration explored 100000 steps with 13891 reset in 99 ms.
Built C files in :
/tmp/ltsmin11740858494362090565
[2024-05-22 15:28:06] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-22 15:28:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:28:06] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-22 15:28:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:28:06] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-22 15:28:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:28:06] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11740858494362090565
Running compilation step : cd /tmp/ltsmin11740858494362090565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 607 ms.
Running link step : cd /tmp/ltsmin11740858494362090565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11740858494362090565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7401176370896837507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-22 15:28:21] [INFO ] Computed 49 invariants in 13 ms
[2024-05-22 15:28:21] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 15:28:21] [INFO ] Invariant cache hit.
[2024-05-22 15:28:21] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:28:22] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2024-05-22 15:28:22] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 15:28:22] [INFO ] Invariant cache hit.
[2024-05-22 15:28:22] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:28:35] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:28:35] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:28:35] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:28:35] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:28:35] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:28:38] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:28:38] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-22 15:28:39] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:28:39] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-05-22 15:28:40] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 5/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 350 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 600 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/10 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61329 ms. Remains : 273/273 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin10220175361970557216
[2024-05-22 15:29:22] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-22 15:29:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:29:22] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-22 15:29:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:29:22] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-22 15:29:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:29:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10220175361970557216
Running compilation step : cd /tmp/ltsmin10220175361970557216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 597 ms.
Running link step : cd /tmp/ltsmin10220175361970557216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10220175361970557216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4915030659836856887.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 15:29:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:29:37] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:29:37] [INFO ] Time to serialize gal into /tmp/LTL14007586136380326344.gal : 3 ms
[2024-05-22 15:29:37] [INFO ] Time to serialize properties into /tmp/LTL3921621756818114130.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14007586136380326344.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5906097889404589514.hoa' '-atoms' '/tmp/LTL3921621756818114130.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3921621756818114130.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5906097889404589514.hoa
Detected timeout of ITS tools.
[2024-05-22 15:29:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:29:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:29:53] [INFO ] Time to serialize gal into /tmp/LTL13404120917458421323.gal : 2 ms
[2024-05-22 15:29:53] [INFO ] Time to serialize properties into /tmp/LTL5338030494306824613.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13404120917458421323.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5338030494306824613.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p334<=p185)"))))
Formula 0 simplified : GF!"(p334<=p185)"
Detected timeout of ITS tools.
[2024-05-22 15:30:08] [INFO ] Flatten gal took : 12 ms
[2024-05-22 15:30:08] [INFO ] Applying decomposition
[2024-05-22 15:30:08] [INFO ] Flatten gal took : 8 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/graph5573063498721139845.txt' '-o' '/tmp/graph5573063498721139845.bin' '-w' '/tmp/graph5573063498721139845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5573063498721139845.bin' '-l' '-1' '-v' '-w' '/tmp/graph5573063498721139845.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:30:08] [INFO ] Decomposing Gal with order
[2024-05-22 15:30:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:30:08] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-22 15:30:08] [INFO ] Flatten gal took : 17 ms
[2024-05-22 15:30:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2024-05-22 15:30:08] [INFO ] Time to serialize gal into /tmp/LTL12447465997330462685.gal : 3 ms
[2024-05-22 15:30:08] [INFO ] Time to serialize properties into /tmp/LTL5083634080840749417.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12447465997330462685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5083634080840749417.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu52.p334<=gu52.p185)"))))
Formula 0 simplified : GF!"(gu52.p334<=gu52.p185)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-05 finished in 377599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 13 ms. Remains 527 /528 variables (removed 1) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-22 15:30:23] [INFO ] Computed 49 invariants in 20 ms
[2024-05-22 15:30:23] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 15:30:23] [INFO ] Invariant cache hit.
[2024-05-22 15:30:25] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 15:30:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 15:30:40] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-22 15:30:40] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 15:30:55] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 579 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/579 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1075 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1075 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 3/3 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62061 ms. Remains : 527/528 places, 497/497 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-07 finished in 62184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1||F(p2)))))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 376
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 406 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 241 place count 405 transition count 355
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 497 place count 277 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 498 place count 276 transition count 264
Applied a total of 498 rules in 31 ms. Remains 276 /528 variables (removed 252) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 276 cols
[2024-05-22 15:31:25] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 15:31:25] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 15:31:25] [INFO ] Invariant cache hit.
[2024-05-22 15:31:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:31:26] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
[2024-05-22 15:31:26] [INFO ] Redundant transitions in 0 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 15:31:26] [INFO ] Invariant cache hit.
[2024-05-22 15:31:26] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/539 variables, 275/324 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 18/342 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/540 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 15:31:40] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:31:40] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:31:40] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-22 15:31:42] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:31:42] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:31:42] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2024-05-22 15:31:44] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:31:44] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/540 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 15:31:53] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:31:53] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:31:53] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/540 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/540 variables, and 354 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 276/276 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/539 variables, 275/324 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 18/342 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 260/602 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/540 variables, and 602 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 275/276 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/263 constraints, Known Traps: 0/11 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 276/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61139 ms. Remains : 276/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-09
Product exploration explored 100000 steps with 13891 reset in 133 ms.
Product exploration explored 100000 steps with 13789 reset in 132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 94 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5617 resets) in 141 ms. (281 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40000 steps (3277 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3245 resets) in 355 ms. (112 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3239 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
[2024-05-22 15:32:27] [INFO ] Invariant cache hit.
[2024-05-22 15:32:27] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 107/113 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 56/169 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 37/206 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 34/240 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 254/494 variables, 240/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 16/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 14 (OVERLAPS) 40/534 variables, 31/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 1/334 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 1/335 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 0/335 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/536 variables, 2/337 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/536 variables, 2/339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/536 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 4/540 variables, 3/342 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/540 variables, 1/343 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/540 variables, 0/343 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/540 variables, 0/343 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 343 constraints, problems are : Problem set: 1 solved, 2 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 276/276 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/113 variables, 16/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/169 variables, 15/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 15:32:27] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/33 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 37/206 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/240 variables, 10/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 254/494 variables, 240/287 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 16/303 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 1/304 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/494 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 40/534 variables, 31/335 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 1/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 1/337 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 1/338 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 15:32:28] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:32:28] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 2/340 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/536 variables, 2/342 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/536 variables, 2/344 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 4/540 variables, 3/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/540 variables, 1/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/540 variables, 0/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/540 variables, 0/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/540 variables, and 348 constraints, problems are : Problem set: 1 solved, 2 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 276/276 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1064ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 222 ms.
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 264/264 transitions.
Graph (complete) has 811 edges and 276 vertex of which 275 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 275 transition count 263
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 275 transition count 226
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 238 transition count 226
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 238 transition count 226
Applied a total of 116 rules in 11 ms. Remains 238 /276 variables (removed 38) and now considering 226/264 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 238/276 places, 226/264 transitions.
RANDOM walk for 16167 steps (2062 resets) in 198 ms. (81 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-010-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLCardinality-09 finished in 63513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1&&F(!p1))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 376
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 406 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 241 place count 405 transition count 356
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 495 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 496 place count 277 transition count 264
Applied a total of 496 rules in 33 ms. Remains 277 /528 variables (removed 251) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 277 cols
[2024-05-22 15:32:28] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 15:32:29] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 15:32:29] [INFO ] Invariant cache hit.
[2024-05-22 15:32:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:32:30] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2024-05-22 15:32:30] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 15:32:30] [INFO ] Invariant cache hit.
[2024-05-22 15:32:30] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/541 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 15:32:44] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:32:44] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:32:44] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:32:44] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:32:44] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:32:45] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:32:45] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:32:45] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:32:46] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/541 variables, 9/353 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 15:32:59] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:32:59] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/541 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 355 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 277/277 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 260/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/541 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 3/607 constraints. Problems are: Problem set: 0 solved, 263 unsolved
SMT process timed out in 60059ms, After SMT, problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 277/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61240 ms. Remains : 277/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, true, (NOT p0), p1]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-10
Stuttering criterion allowed to conclude after 61 steps with 9 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-10 finished in 61374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 9 ms. Remains 527 /528 variables (removed 1) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-22 15:33:30] [INFO ] Computed 49 invariants in 19 ms
[2024-05-22 15:33:30] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 15:33:30] [INFO ] Invariant cache hit.
[2024-05-22 15:33:31] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 15:33:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 15:33:46] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-22 15:33:47] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/578 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 15:34:01] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2024-05-22 15:34:01] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-22 15:34:01] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 581 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/581 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1077 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1077 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 5/5 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61633 ms. Remains : 527/528 places, 497/497 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-11
Product exploration explored 100000 steps with 3314 reset in 97 ms.
Product exploration explored 100000 steps with 3338 reset in 100 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
RANDOM walk for 40000 steps (1326 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7406 steps, run visited all 1 properties in 43 ms. (steps per millisecond=172 )
Probabilistic random walk after 7406 steps, saw 3729 distinct states, run finished after 47 ms. (steps per millisecond=157 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Support contains 2 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 118 rules applied. Total rules applied 235 place count 409 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 237 place count 407 transition count 377
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 237 place count 407 transition count 357
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 277 place count 387 transition count 357
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 463 place count 294 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 499 place count 276 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 500 place count 275 transition count 263
Applied a total of 500 rules in 35 ms. Remains 275 /527 variables (removed 252) and now considering 263/497 (removed 234) transitions.
// Phase 1: matrix 263 rows 275 cols
[2024-05-22 15:34:32] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 15:34:32] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 15:34:32] [INFO ] Invariant cache hit.
[2024-05-22 15:34:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:34:33] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
[2024-05-22 15:34:33] [INFO ] Redundant transitions in 2 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-22 15:34:33] [INFO ] Invariant cache hit.
[2024-05-22 15:34:33] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/537 variables, 274/323 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 1/538 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-22 15:34:46] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:34:46] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:34:46] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:34:46] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:34:46] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-22 15:34:46] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:34:47] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 7/349 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-22 15:34:54] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-22 15:34:55] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:34:56] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/538 variables, and 352 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 275/275 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/537 variables, 274/323 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 259/600 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/538 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 262 unsolved
SMT process timed out in 60066ms, After SMT, problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in SI_LTL mode, iteration 1 : 275/527 places, 263/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61169 ms. Remains : 275/527 places, 263/497 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 855 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
RANDOM walk for 40000 steps (5525 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3200 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3522 steps, run visited all 1 properties in 18 ms. (steps per millisecond=195 )
Probabilistic random walk after 3522 steps, saw 1787 distinct states, run finished after 18 ms. (steps per millisecond=195 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13710 reset in 94 ms.
Product exploration explored 100000 steps with 13794 reset in 101 ms.
Built C files in :
/tmp/ltsmin6343518714029261501
[2024-05-22 15:35:34] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2024-05-22 15:35:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:35:34] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2024-05-22 15:35:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:35:34] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2024-05-22 15:35:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:35:34] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6343518714029261501
Running compilation step : cd /tmp/ltsmin6343518714029261501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin6343518714029261501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6343518714029261501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5104790540042553755.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 263/263 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 275 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 274 transition count 262
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 273 transition count 261
Applied a total of 4 rules in 7 ms. Remains 273 /275 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-22 15:35:49] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 15:35:49] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 15:35:49] [INFO ] Invariant cache hit.
[2024-05-22 15:35:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:35:50] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2024-05-22 15:35:50] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 15:35:50] [INFO ] Invariant cache hit.
[2024-05-22 15:35:50] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:36:04] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:36:04] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:36:04] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/534 variables, 7/347 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:36:17] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:36:17] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 350 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 600 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/10 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/275 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61401 ms. Remains : 273/275 places, 261/263 transitions.
Built C files in :
/tmp/ltsmin4339711600078468238
[2024-05-22 15:36:51] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-22 15:36:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:36:51] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-22 15:36:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:36:51] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-22 15:36:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:36:51] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4339711600078468238
Running compilation step : cd /tmp/ltsmin4339711600078468238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 619 ms.
Running link step : cd /tmp/ltsmin4339711600078468238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4339711600078468238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5974070256397940619.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 15:37:06] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:37:06] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:37:06] [INFO ] Time to serialize gal into /tmp/LTL2414794306753497392.gal : 1 ms
[2024-05-22 15:37:06] [INFO ] Time to serialize properties into /tmp/LTL13145305822253310879.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2414794306753497392.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8147857320746196602.hoa' '-atoms' '/tmp/LTL13145305822253310879.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13145305822253310879.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8147857320746196602.hoa
Detected timeout of ITS tools.
[2024-05-22 15:37:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:37:21] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:37:21] [INFO ] Time to serialize gal into /tmp/LTL5011128500230494508.gal : 1 ms
[2024-05-22 15:37:21] [INFO ] Time to serialize properties into /tmp/LTL3295268097491063877.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5011128500230494508.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3295268097491063877.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(p44>p336)")||(F(G("(p153<=p24)"))))))
Formula 0 simplified : X(!"(p44>p336)" & GF!"(p153<=p24)")
Detected timeout of ITS tools.
[2024-05-22 15:37:36] [INFO ] Flatten gal took : 11 ms
[2024-05-22 15:37:36] [INFO ] Applying decomposition
[2024-05-22 15:37:36] [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/graph16934314921429666304.txt' '-o' '/tmp/graph16934314921429666304.bin' '-w' '/tmp/graph16934314921429666304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16934314921429666304.bin' '-l' '-1' '-v' '-w' '/tmp/graph16934314921429666304.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:37:36] [INFO ] Decomposing Gal with order
[2024-05-22 15:37:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:37:36] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-22 15:37:36] [INFO ] Flatten gal took : 19 ms
[2024-05-22 15:37:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 9 ms.
[2024-05-22 15:37:36] [INFO ] Time to serialize gal into /tmp/LTL7232481137453195155.gal : 4 ms
[2024-05-22 15:37:36] [INFO ] Time to serialize properties into /tmp/LTL7132105806424897399.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7232481137453195155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7132105806424897399.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(gu83.p44>gu83.p336)")||(F(G("(gu32.p153<=gu32.p24)"))))))
Formula 0 simplified : X(!"(gu83.p44>gu83.p336)" & GF!"(gu32.p153<=gu32.p24)")
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-11 finished in 261100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 525 transition count 378
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 408 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 239 place count 406 transition count 355
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 502 place count 274 transition count 262
Applied a total of 502 rules in 23 ms. Remains 274 /528 variables (removed 254) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 15:37:51] [INFO ] Computed 49 invariants in 16 ms
[2024-05-22 15:37:51] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 15:37:51] [INFO ] Invariant cache hit.
[2024-05-22 15:37:51] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 15:37:52] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
[2024-05-22 15:37:52] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 15:37:52] [INFO ] Invariant cache hit.
[2024-05-22 15:37:52] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2024-05-22 15:38:05] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:38:06] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:38:08] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:38:12] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 355 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60065ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61436 ms. Remains : 274/528 places, 262/497 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-12
Product exploration explored 100000 steps with 13870 reset in 99 ms.
Product exploration explored 100000 steps with 13894 reset in 101 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5571 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3193 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 694683 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 1
Probabilistic random walk after 694683 steps, saw 347450 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
[2024-05-22 15:38:56] [INFO ] Invariant cache hit.
[2024-05-22 15:38:56] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/134 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/204 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/238 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/532 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/536 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/134 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/204 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/238 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/530 variables, 31/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/532 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/536 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 575ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 229 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 236 transition count 224
Applied a total of 115 rules in 12 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 236/274 places, 224/262 transitions.
RANDOM walk for 40000 steps (5040 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3375 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 740029 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 740029 steps, saw 370258 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
// Phase 1: matrix 224 rows 236 cols
[2024-05-22 15:39:00] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 15:39:00] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/227 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/231 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 224/455 variables, 231/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 37/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/460 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/227 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:39:00] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:39:00] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:39:00] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:39:00] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:39:00] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:39:00] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:39:00] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:39:00] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/231 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:39:01] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 224/455 variables, 231/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 37/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/460 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/460 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1869 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2053ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 2 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 15:39:02] [INFO ] Invariant cache hit.
[2024-05-22 15:39:02] [INFO ] Implicit Places using invariants in 204 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
[2024-05-22 15:39:02] [INFO ] Actually due to overlaps returned [51, 193, 46, 132]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 205 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 231 transition count 223
Applied a total of 4 rules in 9 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-05-22 15:39:02] [INFO ] Computed 45 invariants in 10 ms
[2024-05-22 15:39:02] [INFO ] Implicit Places using invariants in 198 ms returned [20, 26, 71, 76, 97, 103, 125, 130, 150, 155, 177, 183, 222, 228]
[2024-05-22 15:39:02] [INFO ] Actually due to overlaps returned [76, 228, 71, 222]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 199 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 227/236 places, 223/224 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 225 transition count 221
Applied a total of 4 rules in 7 ms. Remains 225 /227 variables (removed 2) and now considering 221/223 (removed 2) transitions.
// Phase 1: matrix 221 rows 225 cols
[2024-05-22 15:39:02] [INFO ] Computed 41 invariants in 11 ms
[2024-05-22 15:39:02] [INFO ] Implicit Places using invariants in 166 ms returned [20, 26, 94, 100, 122, 127, 147, 152, 174, 180]
[2024-05-22 15:39:02] [INFO ] Actually due to overlaps returned [100, 20, 94, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 167 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 221/236 places, 221/224 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 219 transition count 219
Applied a total of 4 rules in 7 ms. Remains 219 /221 variables (removed 2) and now considering 219/221 (removed 2) transitions.
// Phase 1: matrix 219 rows 219 cols
[2024-05-22 15:39:02] [INFO ] Computed 37 invariants in 13 ms
[2024-05-22 15:39:02] [INFO ] Implicit Places using invariants in 155 ms returned [116, 121, 141, 146, 168, 174]
[2024-05-22 15:39:02] [INFO ] Actually due to overlaps returned [121, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 169 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 217/236 places, 219/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 6 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-22 15:39:02] [INFO ] Computed 35 invariants in 8 ms
[2024-05-22 15:39:03] [INFO ] Implicit Places using invariants in 132 ms returned [138, 143, 165, 171]
[2024-05-22 15:39:03] [INFO ] Actually due to overlaps returned [143, 138]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 133 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 214/236 places, 218/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 5 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 213 cols
[2024-05-22 15:39:03] [INFO ] Computed 33 invariants in 8 ms
[2024-05-22 15:39:03] [INFO ] Implicit Places using invariants in 138 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 138 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 211/236 places, 217/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 5 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 15:39:03] [INFO ] Computed 31 invariants in 8 ms
[2024-05-22 15:39:03] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 15:39:03] [INFO ] Invariant cache hit.
[2024-05-22 15:39:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:39:04] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 210/236 places, 216/224 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 2129 ms. Remains : 210/236 places, 216/224 transitions.
RANDOM walk for 40000 steps (5727 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3619 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Probably explored full state space saw : 264445 states, properties seen :0
Probabilistic random walk after 528899 steps, saw 264445 distinct states, run finished after 2007 ms. (steps per millisecond=263 ) properties seen :0
Interrupted probabilistic random walk after 828346 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 1
Exhaustive walk after 828346 steps, saw 414265 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
[2024-05-22 15:39:09] [INFO ] Invariant cache hit.
[2024-05-22 15:39:09] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/152 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/205 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 216/421 variables, 205/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 37/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/426 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/152 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:39:09] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:39:09] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 53/205 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:39:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:39:09] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 216/421 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 37/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/426 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 755ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 15:39:10] [INFO ] Invariant cache hit.
[2024-05-22 15:39:10] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-22 15:39:10] [INFO ] Invariant cache hit.
[2024-05-22 15:39:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:39:11] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2024-05-22 15:39:11] [INFO ] Redundant transitions in 2 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 15:39:11] [INFO ] Invariant cache hit.
[2024-05-22 15:39:11] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 37/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9359 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 37/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:39:27] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 494 constraints, problems are : Problem set: 0 solved, 215 unsolved in 29436 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 1/1 constraints]
After SMT, in 38854ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 38857ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39930 ms. Remains : 210/210 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 210 transition count 199
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 193 transition count 199
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 184 transition count 190
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 184 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 183 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 183 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 187
Applied a total of 58 rules in 16 ms. Remains 181 /210 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 181 cols
[2024-05-22 15:39:50] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 15:39:50] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:39:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 15:39:50] [INFO ] [Nat]Absence check using 8 positive and 23 generalized place invariants in 4 ms returned sat
[2024-05-22 15:39:50] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:39:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:39:50] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:39:50] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:39:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
TRAPS : Iteration 1
[2024-05-22 15:39:50] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:39:50] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 348 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 15:39:50] [INFO ] Computed 49 invariants in 12 ms
[2024-05-22 15:39:50] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 15:39:50] [INFO ] Invariant cache hit.
[2024-05-22 15:39:50] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 15:39:51] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
[2024-05-22 15:39:51] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 15:39:51] [INFO ] Invariant cache hit.
[2024-05-22 15:39:51] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:40:04] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:40:04] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:40:04] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:40:05] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:40:05] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:40:05] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:40:05] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:40:05] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:40:05] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:40:05] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:40:06] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:40:06] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:40:06] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:40:07] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:40:12] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 355 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60060ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61404 ms. Remains : 274/274 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5550 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3270 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 691746 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 1
Probabilistic random walk after 691746 steps, saw 345983 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2024-05-22 15:40:55] [INFO ] Invariant cache hit.
[2024-05-22 15:40:55] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/134 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/204 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/238 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 40/530 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/532 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/536 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/134 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/204 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/238 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/530 variables, 31/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/532 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/536 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 676ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 228 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 236 transition count 224
Applied a total of 115 rules in 11 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 236/274 places, 224/262 transitions.
RANDOM walk for 40000 steps (5067 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3436 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 737458 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 737458 steps, saw 368974 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
// Phase 1: matrix 224 rows 236 cols
[2024-05-22 15:40:59] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 15:40:59] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/227 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/231 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 224/455 variables, 231/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 37/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/460 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/227 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:40:59] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:40:59] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:40:59] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:40:59] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:40:59] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:40:59] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:40:59] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/231 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:41:00] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 224/455 variables, 231/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 37/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/460 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/460 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1865 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 236/236 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2062ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 15:41:01] [INFO ] Invariant cache hit.
[2024-05-22 15:41:01] [INFO ] Implicit Places using invariants in 208 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
[2024-05-22 15:41:01] [INFO ] Actually due to overlaps returned [51, 193, 46, 132]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 208 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 231 transition count 223
Applied a total of 4 rules in 9 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-05-22 15:41:01] [INFO ] Computed 45 invariants in 12 ms
[2024-05-22 15:41:01] [INFO ] Implicit Places using invariants in 192 ms returned [20, 26, 71, 76, 97, 103, 125, 130, 150, 155, 177, 183, 222, 228]
[2024-05-22 15:41:01] [INFO ] Actually due to overlaps returned [76, 228, 71, 222]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 193 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 227/236 places, 223/224 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 225 transition count 221
Applied a total of 4 rules in 6 ms. Remains 225 /227 variables (removed 2) and now considering 221/223 (removed 2) transitions.
// Phase 1: matrix 221 rows 225 cols
[2024-05-22 15:41:01] [INFO ] Computed 41 invariants in 11 ms
[2024-05-22 15:41:01] [INFO ] Implicit Places using invariants in 166 ms returned [20, 26, 94, 100, 122, 127, 147, 152, 174, 180]
[2024-05-22 15:41:01] [INFO ] Actually due to overlaps returned [100, 20, 94, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 166 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 221/236 places, 221/224 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 219 transition count 219
Applied a total of 4 rules in 8 ms. Remains 219 /221 variables (removed 2) and now considering 219/221 (removed 2) transitions.
// Phase 1: matrix 219 rows 219 cols
[2024-05-22 15:41:01] [INFO ] Computed 37 invariants in 9 ms
[2024-05-22 15:41:01] [INFO ] Implicit Places using invariants in 146 ms returned [116, 121, 141, 146, 168, 174]
[2024-05-22 15:41:01] [INFO ] Actually due to overlaps returned [121, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 146 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 217/236 places, 219/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 6 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-22 15:41:01] [INFO ] Computed 35 invariants in 9 ms
[2024-05-22 15:41:02] [INFO ] Implicit Places using invariants in 139 ms returned [138, 143, 165, 171]
[2024-05-22 15:41:02] [INFO ] Actually due to overlaps returned [143, 138]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 139 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 214/236 places, 218/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 5 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 213 cols
[2024-05-22 15:41:02] [INFO ] Computed 33 invariants in 7 ms
[2024-05-22 15:41:02] [INFO ] Implicit Places using invariants in 126 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 127 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 211/236 places, 217/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 5 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 15:41:02] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 15:41:02] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 15:41:02] [INFO ] Invariant cache hit.
[2024-05-22 15:41:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:41:03] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 210/236 places, 216/224 transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 2092 ms. Remains : 210/236 places, 216/224 transitions.
RANDOM walk for 40000 steps (5655 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3630 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Probably explored full state space saw : 264445 states, properties seen :0
Probabilistic random walk after 528899 steps, saw 264445 distinct states, run finished after 2001 ms. (steps per millisecond=264 ) properties seen :0
Interrupted probabilistic random walk after 808866 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 1
Exhaustive walk after 808866 steps, saw 404523 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
[2024-05-22 15:41:08] [INFO ] Invariant cache hit.
[2024-05-22 15:41:08] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/152 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/205 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 216/421 variables, 205/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 37/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/426 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/152 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:41:08] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:41:08] [INFO ] Deduced a trap composed of 94 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 53/205 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:41:08] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:41:08] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 216/421 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 37/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/426 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 781ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 15:41:09] [INFO ] Invariant cache hit.
[2024-05-22 15:41:09] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 15:41:09] [INFO ] Invariant cache hit.
[2024-05-22 15:41:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 15:41:10] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2024-05-22 15:41:10] [INFO ] Redundant transitions in 2 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 15:41:10] [INFO ] Invariant cache hit.
[2024-05-22 15:41:10] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 37/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 278 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9465 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/426 variables, 210/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 37/278 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 215/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 15:41:26] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 494 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 1/1 constraints]
After SMT, in 39535ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39538ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40607 ms. Remains : 210/210 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 210 transition count 199
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 193 transition count 199
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 184 transition count 190
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 184 transition count 190
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 54 place count 183 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 183 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 187
Applied a total of 58 rules in 14 ms. Remains 181 /210 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 181 cols
[2024-05-22 15:41:49] [INFO ] Computed 31 invariants in 4 ms
[2024-05-22 15:41:49] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:41:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 15:41:49] [INFO ] [Nat]Absence check using 8 positive and 23 generalized place invariants in 5 ms returned sat
[2024-05-22 15:41:49] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:41:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:41:49] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:41:50] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
TRAPS : Iteration 1
[2024-05-22 15:41:50] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:41:50] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 361 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13903 reset in 89 ms.
Product exploration explored 100000 steps with 13922 reset in 107 ms.
Built C files in :
/tmp/ltsmin4386830082293260402
[2024-05-22 15:41:50] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-22 15:41:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:41:50] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-22 15:41:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:41:50] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-22 15:41:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:41:50] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4386830082293260402
Running compilation step : cd /tmp/ltsmin4386830082293260402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 612 ms.
Running link step : cd /tmp/ltsmin4386830082293260402;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4386830082293260402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17152459559367685061.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-22 15:42:05] [INFO ] Computed 49 invariants in 12 ms
[2024-05-22 15:42:05] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 15:42:05] [INFO ] Invariant cache hit.
[2024-05-22 15:42:05] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 15:42:06] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2024-05-22 15:42:06] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 15:42:06] [INFO ] Invariant cache hit.
[2024-05-22 15:42:06] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:42:19] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:42:19] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:42:19] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:42:20] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:42:20] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:42:20] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:42:20] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:42:20] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:42:20] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:42:20] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-22 15:42:20] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:42:20] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:42:21] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:42:22] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 15:42:26] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 355 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 17/339 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60059ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61389 ms. Remains : 274/274 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin7896452639638669642
[2024-05-22 15:43:07] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-22 15:43:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:43:07] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-22 15:43:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:43:07] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-22 15:43:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:43:07] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7896452639638669642
Running compilation step : cd /tmp/ltsmin7896452639638669642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 595 ms.
Running link step : cd /tmp/ltsmin7896452639638669642;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7896452639638669642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7425316226975135558.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 15:43:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:43:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:43:22] [INFO ] Time to serialize gal into /tmp/LTL9059212834707177045.gal : 2 ms
[2024-05-22 15:43:22] [INFO ] Time to serialize properties into /tmp/LTL10474664318115538572.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9059212834707177045.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1307162650350340111.hoa' '-atoms' '/tmp/LTL10474664318115538572.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10474664318115538572.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1307162650350340111.hoa
Detected timeout of ITS tools.
[2024-05-22 15:43:37] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:43:37] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:43:37] [INFO ] Time to serialize gal into /tmp/LTL6328844520777813611.gal : 2 ms
[2024-05-22 15:43:37] [INFO ] Time to serialize properties into /tmp/LTL8128831279718341081.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6328844520777813611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8128831279718341081.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(p212<=p321)"))))
Formula 0 simplified : GF!"(p212<=p321)"
Detected timeout of ITS tools.
[2024-05-22 15:43:52] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:43:52] [INFO ] Applying decomposition
[2024-05-22 15:43:52] [INFO ] Flatten gal took : 7 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/graph9463270971514250301.txt' '-o' '/tmp/graph9463270971514250301.bin' '-w' '/tmp/graph9463270971514250301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9463270971514250301.bin' '-l' '-1' '-v' '-w' '/tmp/graph9463270971514250301.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:43:52] [INFO ] Decomposing Gal with order
[2024-05-22 15:43:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:43:52] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-22 15:43:52] [INFO ] Flatten gal took : 19 ms
[2024-05-22 15:43:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2024-05-22 15:43:52] [INFO ] Time to serialize gal into /tmp/LTL9396934170550266053.gal : 3 ms
[2024-05-22 15:43:52] [INFO ] Time to serialize properties into /tmp/LTL9086179501460547324.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9396934170550266053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9086179501460547324.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu52.p212<=gu52.p321)"))))
Formula 0 simplified : GF!"(gu52.p212<=gu52.p321)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-12 finished in 376038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 119 rules applied. Total rules applied 236 place count 409 transition count 376
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 239 place count 406 transition count 355
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 497 place count 277 transition count 265
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 499 place count 277 transition count 265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 500 place count 276 transition count 264
Iterating global reduction 3 with 1 rules applied. Total rules applied 501 place count 276 transition count 264
Applied a total of 501 rules in 31 ms. Remains 276 /528 variables (removed 252) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 276 cols
[2024-05-22 15:44:07] [INFO ] Computed 49 invariants in 14 ms
[2024-05-22 15:44:07] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 15:44:07] [INFO ] Invariant cache hit.
[2024-05-22 15:44:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:44:08] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2024-05-22 15:44:08] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 15:44:08] [INFO ] Invariant cache hit.
[2024-05-22 15:44:08] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 264/540 variables, 276/325 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 15:44:18] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:44:19] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:44:19] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:44:20] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:44:20] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:44:20] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 6/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/540 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 349 constraints, problems are : Problem set: 0 solved, 263 unsolved in 28127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 276/276 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 264/540 variables, 276/331 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 18/349 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 263/612 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 15:44:47] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:44:47] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 614 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 276/276 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
After SMT, in 58180ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 58183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 276/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59435 ms. Remains : 276/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-13
Stuttering criterion allowed to conclude after 59 steps with 10 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-13 finished in 59524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p0)))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 527 transition count 375
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 406 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 242 place count 406 transition count 355
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 282 place count 386 transition count 355
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 468 place count 293 transition count 262
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 504 place count 275 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 505 place count 274 transition count 261
Applied a total of 505 rules in 27 ms. Remains 274 /528 variables (removed 254) and now considering 261/497 (removed 236) transitions.
// Phase 1: matrix 261 rows 274 cols
[2024-05-22 15:45:07] [INFO ] Computed 50 invariants in 12 ms
[2024-05-22 15:45:07] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 15:45:07] [INFO ] Invariant cache hit.
[2024-05-22 15:45:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:45:08] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2024-05-22 15:45:08] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 15:45:08] [INFO ] Invariant cache hit.
[2024-05-22 15:45:08] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/274 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:45:12] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:45:12] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:45:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 15:45:13] [INFO ] Deduced a trap composed of 139 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:45:13] [INFO ] Deduced a trap composed of 104 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/535 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 18/347 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:45:19] [INFO ] Deduced a trap composed of 108 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:45:19] [INFO ] Deduced a trap composed of 122 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:45:19] [INFO ] Deduced a trap composed of 123 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:45:20] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:45:20] [INFO ] Deduced a trap composed of 118 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:45:20] [INFO ] Deduced a trap composed of 110 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:45:20] [INFO ] Deduced a trap composed of 115 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:45:21] [INFO ] Deduced a trap composed of 124 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:45:21] [INFO ] Deduced a trap composed of 117 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:45:21] [INFO ] Deduced a trap composed of 123 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:45:21] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:45:22] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:45:22] [INFO ] Deduced a trap composed of 130 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:45:22] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:45:22] [INFO ] Deduced a trap composed of 120 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 15/362 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:45:23] [INFO ] Deduced a trap composed of 88 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:45:26] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:45:26] [INFO ] Deduced a trap composed of 125 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:45:26] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:45:26] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:45:26] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 6/368 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:45:30] [INFO ] Deduced a trap composed of 127 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:45:30] [INFO ] Deduced a trap composed of 131 places in 74 ms of which 3 ms to minimize.
[2024-05-22 15:45:31] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:45:32] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:45:32] [INFO ] Deduced a trap composed of 113 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:45:32] [INFO ] Deduced a trap composed of 126 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:45:32] [INFO ] Deduced a trap composed of 130 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:45:32] [INFO ] Deduced a trap composed of 133 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:45:32] [INFO ] Deduced a trap composed of 132 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:45:32] [INFO ] Deduced a trap composed of 137 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:45:32] [INFO ] Deduced a trap composed of 138 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:45:32] [INFO ] Deduced a trap composed of 132 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:45:33] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:45:33] [INFO ] Deduced a trap composed of 119 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:45:34] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 15/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:45:36] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:45:36] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:45:36] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:45:37] [INFO ] Deduced a trap composed of 139 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:45:37] [INFO ] Deduced a trap composed of 136 places in 65 ms of which 2 ms to minimize.
[2024-05-22 15:45:37] [INFO ] Deduced a trap composed of 139 places in 66 ms of which 2 ms to minimize.
[2024-05-22 15:45:37] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:45:38] [INFO ] Deduced a trap composed of 147 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 391 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/274 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 48/99 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/535 variables, 274/373 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 18/391 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 260/651 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 108 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 114 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 114 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 113 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 113 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:45:54] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:45:54] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:45:54] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:45:54] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:45:54] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:45:54] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:45:54] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:45:54] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:45:54] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:45:55] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:45:55] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:45:55] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 0 ms to minimize.
[2024-05-22 15:45:55] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 20/671 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:46:01] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:46:02] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 673 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 71/71 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61205 ms. Remains : 274/528 places, 261/497 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-14
Product exploration explored 100000 steps with 13927 reset in 87 ms.
Product exploration explored 100000 steps with 13838 reset in 95 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 857 edges and 274 vertex of which 271 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5525 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3285 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 693883 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 1
Probabilistic random walk after 693883 steps, saw 347051 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
[2024-05-22 15:46:11] [INFO ] Invariant cache hit.
[2024-05-22 15:46:11] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/270 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/531 variables, 270/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 18/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/535 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/270 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:46:12] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:46:12] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:46:12] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:46:12] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-22 15:46:12] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 261/531 variables, 270/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/535 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/535 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 915ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3572 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 261/261 transitions.
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 274 transition count 223
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 76 place count 236 transition count 223
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 114 place count 236 transition count 223
Applied a total of 114 rules in 9 ms. Remains 236 /274 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 236/274 places, 223/261 transitions.
RANDOM walk for 40000 steps (5107 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3384 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 727252 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 727252 steps, saw 363855 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
// Phase 1: matrix 223 rows 236 cols
[2024-05-22 15:46:19] [INFO ] Computed 50 invariants in 12 ms
[2024-05-22 15:46:19] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/230 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/232 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/455 variables, 232/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 38/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/459 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/459 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 103/230 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/232 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/455 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 38/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/459 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/459 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 996ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2812 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 15:46:22] [INFO ] Invariant cache hit.
[2024-05-22 15:46:23] [INFO ] Implicit Places using invariants in 290 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 227, 233]
[2024-05-22 15:46:23] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 291 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 222
Applied a total of 2 rules in 7 ms. Remains 233 /234 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 233 cols
[2024-05-22 15:46:23] [INFO ] Computed 48 invariants in 7 ms
[2024-05-22 15:46:23] [INFO ] Implicit Places using invariants in 262 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183, 224, 230]
[2024-05-22 15:46:23] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 263 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 222/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 221
Applied a total of 2 rules in 6 ms. Remains 230 /231 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 230 cols
[2024-05-22 15:46:23] [INFO ] Computed 46 invariants in 11 ms
[2024-05-22 15:46:23] [INFO ] Implicit Places using invariants in 263 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183]
[2024-05-22 15:46:23] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 275 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 221/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 220
Applied a total of 2 rules in 6 ms. Remains 227 /228 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 227 cols
[2024-05-22 15:46:23] [INFO ] Computed 44 invariants in 13 ms
[2024-05-22 15:46:24] [INFO ] Implicit Places using invariants in 218 ms returned [43, 48, 70, 75, 95, 101, 122, 127, 147, 152, 174, 180]
[2024-05-22 15:46:24] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 218 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 220/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 219
Applied a total of 2 rules in 7 ms. Remains 224 /225 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 224 cols
[2024-05-22 15:46:24] [INFO ] Computed 42 invariants in 9 ms
[2024-05-22 15:46:24] [INFO ] Implicit Places using invariants in 186 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 171, 177]
[2024-05-22 15:46:24] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 187 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 219/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 218
Applied a total of 2 rules in 6 ms. Remains 221 /222 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 221 cols
[2024-05-22 15:46:24] [INFO ] Computed 40 invariants in 9 ms
[2024-05-22 15:46:24] [INFO ] Implicit Places using invariants in 179 ms returned [89, 95, 116, 121, 141, 146, 168, 174]
[2024-05-22 15:46:24] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 179 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 218/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Applied a total of 2 rules in 6 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 218 cols
[2024-05-22 15:46:24] [INFO ] Computed 38 invariants in 10 ms
[2024-05-22 15:46:24] [INFO ] Implicit Places using invariants in 162 ms returned [113, 118, 138, 143, 165, 171]
[2024-05-22 15:46:24] [INFO ] Actually due to overlaps returned [118, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 162 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 217/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 7 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 215 cols
[2024-05-22 15:46:24] [INFO ] Computed 36 invariants in 8 ms
[2024-05-22 15:46:24] [INFO ] Implicit Places using invariants in 149 ms returned [135, 140, 162, 168]
[2024-05-22 15:46:24] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 149 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 216/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 6 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 212 cols
[2024-05-22 15:46:24] [INFO ] Computed 34 invariants in 10 ms
[2024-05-22 15:46:24] [INFO ] Implicit Places using invariants in 141 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 142 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 215/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 5 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 209 cols
[2024-05-22 15:46:24] [INFO ] Computed 32 invariants in 8 ms
[2024-05-22 15:46:25] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 15:46:25] [INFO ] Invariant cache hit.
[2024-05-22 15:46:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:46:26] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3526 ms. Remains : 209/236 places, 214/223 transitions.
RANDOM walk for 40000 steps (5739 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3646 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 804352 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :0 out of 1
Probabilistic random walk after 804352 steps, saw 402258 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :0
[2024-05-22 15:46:29] [INFO ] Invariant cache hit.
[2024-05-22 15:46:29] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/205 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 214/419 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 38/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/423 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:46:29] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 66/205 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:46:29] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-05-22 15:46:29] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:46:30] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/419 variables, 205/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/423 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 705ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2350 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 15:46:32] [INFO ] Invariant cache hit.
[2024-05-22 15:46:32] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 15:46:32] [INFO ] Invariant cache hit.
[2024-05-22 15:46:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:46:34] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2024-05-22 15:46:34] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 15:46:34] [INFO ] Invariant cache hit.
[2024-05-22 15:46:34] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/209 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9530 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/209 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:46:50] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:46:51] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/423 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 494 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 2/2 constraints]
After SMT, in 39617ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41224 ms. Remains : 209/209 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 182 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 182 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 179 transition count 184
Applied a total of 60 rules in 9 ms. Remains 179 /209 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 179 cols
[2024-05-22 15:47:13] [INFO ] Computed 32 invariants in 14 ms
[2024-05-22 15:47:13] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:47:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 15:47:13] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-22 15:47:14] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:47:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:47:14] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:47:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:47:14] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:47:14] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:47:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 157 ms
TRAPS : Iteration 1
[2024-05-22 15:47:14] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:47:14] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 399 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 274 /274 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 274 cols
[2024-05-22 15:47:14] [INFO ] Computed 50 invariants in 8 ms
[2024-05-22 15:47:14] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 15:47:14] [INFO ] Invariant cache hit.
[2024-05-22 15:47:14] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:47:15] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
[2024-05-22 15:47:15] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 15:47:15] [INFO ] Invariant cache hit.
[2024-05-22 15:47:15] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/274 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:47:20] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:47:20] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:47:20] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 15:47:20] [INFO ] Deduced a trap composed of 139 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:47:20] [INFO ] Deduced a trap composed of 104 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/535 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 18/347 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:47:27] [INFO ] Deduced a trap composed of 108 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:47:27] [INFO ] Deduced a trap composed of 122 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:47:27] [INFO ] Deduced a trap composed of 123 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:47:28] [INFO ] Deduced a trap composed of 114 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:47:28] [INFO ] Deduced a trap composed of 118 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:47:28] [INFO ] Deduced a trap composed of 110 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:47:28] [INFO ] Deduced a trap composed of 115 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:47:28] [INFO ] Deduced a trap composed of 124 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:47:28] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:47:28] [INFO ] Deduced a trap composed of 123 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:47:29] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:47:29] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:47:29] [INFO ] Deduced a trap composed of 130 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:47:30] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-05-22 15:47:30] [INFO ] Deduced a trap composed of 120 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 15/362 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:47:31] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:47:33] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:47:33] [INFO ] Deduced a trap composed of 125 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:47:33] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:47:33] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:47:33] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 6/368 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:47:38] [INFO ] Deduced a trap composed of 127 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:47:38] [INFO ] Deduced a trap composed of 131 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:47:38] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:47:39] [INFO ] Deduced a trap composed of 121 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:47:39] [INFO ] Deduced a trap composed of 113 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:47:39] [INFO ] Deduced a trap composed of 126 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:47:40] [INFO ] Deduced a trap composed of 130 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:47:40] [INFO ] Deduced a trap composed of 133 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:47:40] [INFO ] Deduced a trap composed of 132 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:47:40] [INFO ] Deduced a trap composed of 137 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:47:40] [INFO ] Deduced a trap composed of 138 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:47:40] [INFO ] Deduced a trap composed of 132 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:47:41] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-22 15:47:41] [INFO ] Deduced a trap composed of 119 places in 64 ms of which 2 ms to minimize.
[2024-05-22 15:47:42] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 15/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:47:43] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:47:44] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:47:44] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:47:45] [INFO ] Deduced a trap composed of 139 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:47:45] [INFO ] Deduced a trap composed of 136 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:47:45] [INFO ] Deduced a trap composed of 139 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:47:45] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 390 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/274 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 47/98 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/535 variables, 274/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 18/390 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 260/650 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:48:00] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:48:00] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:48:00] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:48:00] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:48:01] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:48:01] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:48:01] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:48:02] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:48:02] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:48:05] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:48:05] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:48:07] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:48:07] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 13/663 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 663 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 61/61 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61281 ms. Remains : 274/274 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 857 edges and 274 vertex of which 271 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5576 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3264 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 697481 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 697481 steps, saw 348849 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
[2024-05-22 15:48:18] [INFO ] Invariant cache hit.
[2024-05-22 15:48:18] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/270 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/531 variables, 270/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 18/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/535 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/270 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:48:19] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:48:19] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:48:19] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:48:19] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-22 15:48:19] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 261/531 variables, 270/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/535 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/535 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 913ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3547 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 261/261 transitions.
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 274 transition count 223
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 76 place count 236 transition count 223
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 114 place count 236 transition count 223
Applied a total of 114 rules in 10 ms. Remains 236 /274 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 236/274 places, 223/261 transitions.
RANDOM walk for 40000 steps (5039 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3374 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 732026 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 732026 steps, saw 366259 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
// Phase 1: matrix 223 rows 236 cols
[2024-05-22 15:48:26] [INFO ] Computed 50 invariants in 15 ms
[2024-05-22 15:48:26] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/230 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/232 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/455 variables, 232/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 38/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/459 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/459 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:48:26] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:48:26] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 103/230 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:48:26] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:48:26] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2024-05-22 15:48:26] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:48:26] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-22 15:48:27] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:48:27] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:48:27] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/232 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/455 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 38/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/459 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/459 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1016ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2819 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 15:48:30] [INFO ] Invariant cache hit.
[2024-05-22 15:48:30] [INFO ] Implicit Places using invariants in 302 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 227, 233]
[2024-05-22 15:48:30] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 303 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 222
Applied a total of 2 rules in 7 ms. Remains 233 /234 variables (removed 1) and now considering 222/223 (removed 1) transitions.
// Phase 1: matrix 222 rows 233 cols
[2024-05-22 15:48:30] [INFO ] Computed 48 invariants in 7 ms
[2024-05-22 15:48:30] [INFO ] Implicit Places using invariants in 258 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183, 224, 230]
[2024-05-22 15:48:30] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 259 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 222/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 221
Applied a total of 2 rules in 6 ms. Remains 230 /231 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 230 cols
[2024-05-22 15:48:30] [INFO ] Computed 46 invariants in 12 ms
[2024-05-22 15:48:31] [INFO ] Implicit Places using invariants in 234 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183]
[2024-05-22 15:48:31] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 221/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 220
Applied a total of 2 rules in 7 ms. Remains 227 /228 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 227 cols
[2024-05-22 15:48:31] [INFO ] Computed 44 invariants in 10 ms
[2024-05-22 15:48:31] [INFO ] Implicit Places using invariants in 209 ms returned [43, 48, 70, 75, 95, 101, 122, 127, 147, 152, 174, 180]
[2024-05-22 15:48:31] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 210 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 220/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 219
Applied a total of 2 rules in 6 ms. Remains 224 /225 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 224 cols
[2024-05-22 15:48:31] [INFO ] Computed 42 invariants in 8 ms
[2024-05-22 15:48:31] [INFO ] Implicit Places using invariants in 191 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 171, 177]
[2024-05-22 15:48:31] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 196 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 219/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 218
Applied a total of 2 rules in 5 ms. Remains 221 /222 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 221 cols
[2024-05-22 15:48:31] [INFO ] Computed 40 invariants in 12 ms
[2024-05-22 15:48:31] [INFO ] Implicit Places using invariants in 189 ms returned [89, 95, 116, 121, 141, 146, 168, 174]
[2024-05-22 15:48:31] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 190 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 218/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Applied a total of 2 rules in 6 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 218 cols
[2024-05-22 15:48:31] [INFO ] Computed 38 invariants in 11 ms
[2024-05-22 15:48:31] [INFO ] Implicit Places using invariants in 179 ms returned [113, 118, 138, 143, 165, 171]
[2024-05-22 15:48:31] [INFO ] Actually due to overlaps returned [118, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 180 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 217/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 7 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 215 cols
[2024-05-22 15:48:31] [INFO ] Computed 36 invariants in 11 ms
[2024-05-22 15:48:32] [INFO ] Implicit Places using invariants in 157 ms returned [135, 140, 162, 168]
[2024-05-22 15:48:32] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 158 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 216/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 7 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 212 cols
[2024-05-22 15:48:32] [INFO ] Computed 34 invariants in 11 ms
[2024-05-22 15:48:32] [INFO ] Implicit Places using invariants in 147 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 148 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 215/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 209 cols
[2024-05-22 15:48:32] [INFO ] Computed 32 invariants in 7 ms
[2024-05-22 15:48:32] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 15:48:32] [INFO ] Invariant cache hit.
[2024-05-22 15:48:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:48:33] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 3509 ms. Remains : 209/236 places, 214/223 transitions.
RANDOM walk for 40000 steps (5686 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3625 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 797549 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 797549 steps, saw 398857 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2024-05-22 15:48:36] [INFO ] Invariant cache hit.
[2024-05-22 15:48:36] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/205 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 214/419 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 38/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/423 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:48:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 66/205 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:48:37] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-05-22 15:48:37] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-05-22 15:48:37] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/419 variables, 205/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/423 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 697ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2354 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 15:48:39] [INFO ] Invariant cache hit.
[2024-05-22 15:48:39] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 15:48:39] [INFO ] Invariant cache hit.
[2024-05-22 15:48:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:48:41] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1607 ms to find 0 implicit places.
[2024-05-22 15:48:41] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 15:48:41] [INFO ] Invariant cache hit.
[2024-05-22 15:48:41] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/209 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9581 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/209 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:48:58] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-22 15:48:59] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/423 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 494 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 2/2 constraints]
After SMT, in 39666ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41282 ms. Remains : 209/209 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 182 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 182 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 179 transition count 184
Applied a total of 60 rules in 11 ms. Remains 179 /209 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 179 cols
[2024-05-22 15:49:21] [INFO ] Computed 32 invariants in 11 ms
[2024-05-22 15:49:21] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:49:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-22 15:49:21] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-22 15:49:21] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:49:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 15:49:21] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:49:21] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:49:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:49:21] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-22 15:49:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 148 ms
TRAPS : Iteration 1
[2024-05-22 15:49:21] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:49:21] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 361 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13875 reset in 95 ms.
Product exploration explored 100000 steps with 13781 reset in 100 ms.
Built C files in :
/tmp/ltsmin3307140482815046021
[2024-05-22 15:49:22] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-22 15:49:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:49:22] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-22 15:49:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:49:22] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-22 15:49:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:49:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3307140482815046021
Running compilation step : cd /tmp/ltsmin3307140482815046021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 617 ms.
Running link step : cd /tmp/ltsmin3307140482815046021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3307140482815046021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8154124888099525976.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 274 /274 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 274 cols
[2024-05-22 15:49:37] [INFO ] Computed 50 invariants in 7 ms
[2024-05-22 15:49:37] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-22 15:49:37] [INFO ] Invariant cache hit.
[2024-05-22 15:49:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 15:49:38] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2024-05-22 15:49:38] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 15:49:38] [INFO ] Invariant cache hit.
[2024-05-22 15:49:38] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/274 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:49:42] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:49:42] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:49:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 15:49:43] [INFO ] Deduced a trap composed of 139 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:49:43] [INFO ] Deduced a trap composed of 104 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/535 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 18/347 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:49:50] [INFO ] Deduced a trap composed of 108 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:49:50] [INFO ] Deduced a trap composed of 122 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:49:50] [INFO ] Deduced a trap composed of 123 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:49:50] [INFO ] Deduced a trap composed of 114 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:49:51] [INFO ] Deduced a trap composed of 118 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:49:51] [INFO ] Deduced a trap composed of 110 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:49:51] [INFO ] Deduced a trap composed of 115 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:49:51] [INFO ] Deduced a trap composed of 124 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:49:51] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:49:51] [INFO ] Deduced a trap composed of 123 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:49:52] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-05-22 15:49:52] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:49:52] [INFO ] Deduced a trap composed of 130 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:49:53] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:49:53] [INFO ] Deduced a trap composed of 120 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 15/362 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:49:54] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:49:56] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:49:56] [INFO ] Deduced a trap composed of 125 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:49:56] [INFO ] Deduced a trap composed of 90 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:49:56] [INFO ] Deduced a trap composed of 95 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:49:57] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 6/368 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:50:01] [INFO ] Deduced a trap composed of 127 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:50:01] [INFO ] Deduced a trap composed of 131 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:50:01] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:50:02] [INFO ] Deduced a trap composed of 121 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:50:03] [INFO ] Deduced a trap composed of 113 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:50:03] [INFO ] Deduced a trap composed of 126 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:50:03] [INFO ] Deduced a trap composed of 130 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:50:03] [INFO ] Deduced a trap composed of 133 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:50:03] [INFO ] Deduced a trap composed of 132 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:50:03] [INFO ] Deduced a trap composed of 137 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:50:03] [INFO ] Deduced a trap composed of 138 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:50:03] [INFO ] Deduced a trap composed of 132 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:50:04] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:50:04] [INFO ] Deduced a trap composed of 119 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:50:05] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 15/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:50:07] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:50:07] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:50:08] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 386 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/274 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/535 variables, 274/368 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 18/386 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 260/646 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:50:20] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 100 places in 60 ms of which 2 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:50:23] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 0 ms to minimize.
[2024-05-22 15:50:23] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:50:23] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:50:23] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:50:23] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:50:23] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:50:23] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:50:24] [INFO ] Deduced a trap composed of 112 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:50:24] [INFO ] Deduced a trap composed of 104 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:50:24] [INFO ] Deduced a trap composed of 118 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:50:24] [INFO ] Deduced a trap composed of 114 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:50:24] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:50:24] [INFO ] Deduced a trap composed of 119 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:50:24] [INFO ] Deduced a trap composed of 121 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:50:25] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:50:25] [INFO ] Deduced a trap composed of 103 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 20/666 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 15:50:31] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:50:31] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:50:35] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:50:35] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 4/670 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 670 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 68/68 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61318 ms. Remains : 274/274 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin9265065481519588292
[2024-05-22 15:50:38] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-22 15:50:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:50:38] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-22 15:50:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:50:38] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-22 15:50:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:50:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9265065481519588292
Running compilation step : cd /tmp/ltsmin9265065481519588292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 621 ms.
Running link step : cd /tmp/ltsmin9265065481519588292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9265065481519588292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17335939317364324213.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 15:50:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:50:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:50:53] [INFO ] Time to serialize gal into /tmp/LTL5210443361454799757.gal : 11 ms
[2024-05-22 15:50:53] [INFO ] Time to serialize properties into /tmp/LTL9409388997455066514.prop : 8 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5210443361454799757.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6446777642689352432.hoa' '-atoms' '/tmp/LTL9409388997455066514.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9409388997455066514.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6446777642689352432.hoa
Detected timeout of ITS tools.
[2024-05-22 15:51:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:51:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:51:08] [INFO ] Time to serialize gal into /tmp/LTL8952913300018599079.gal : 2 ms
[2024-05-22 15:51:08] [INFO ] Time to serialize properties into /tmp/LTL14143892863830836915.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8952913300018599079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14143892863830836915.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(p496<=p229)")&&(G(F("(p496<=p229)"))))))
Formula 0 simplified : FG!"(p496<=p229)"
Detected timeout of ITS tools.
[2024-05-22 15:51:23] [INFO ] Flatten gal took : 10 ms
[2024-05-22 15:51:23] [INFO ] Applying decomposition
[2024-05-22 15:51:23] [INFO ] Flatten gal took : 8 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/graph11616022016825470978.txt' '-o' '/tmp/graph11616022016825470978.bin' '-w' '/tmp/graph11616022016825470978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11616022016825470978.bin' '-l' '-1' '-v' '-w' '/tmp/graph11616022016825470978.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:51:23] [INFO ] Decomposing Gal with order
[2024-05-22 15:51:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:51:23] [INFO ] Removed a total of 227 redundant transitions.
[2024-05-22 15:51:23] [INFO ] Flatten gal took : 16 ms
[2024-05-22 15:51:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2024-05-22 15:51:23] [INFO ] Time to serialize gal into /tmp/LTL9007738565053541006.gal : 2 ms
[2024-05-22 15:51:23] [INFO ] Time to serialize properties into /tmp/LTL4793900307060748247.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9007738565053541006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4793900307060748247.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("(gu28.p496<=gu28.p229)")&&(G(F("(gu28.p496<=gu28.p229)"))))))
Formula 0 simplified : FG!"(gu28.p496<=gu28.p229)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-14 finished in 391952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p0)))))'
[2024-05-22 15:51:39] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4508925313653613619
[2024-05-22 15:51:39] [INFO ] Applying decomposition
[2024-05-22 15:51:39] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2024-05-22 15:51:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:51:39] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2024-05-22 15:51:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:51:39] [INFO ] Flatten gal took : 14 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/graph3859012597337696665.txt' '-o' '/tmp/graph3859012597337696665.bin' '-w' '/tmp/graph3859012597337696665.weights'
[2024-05-22 15:51:39] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2024-05-22 15:51:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 15:51:39] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4508925313653613619
Running compilation step : cd /tmp/ltsmin4508925313653613619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3859012597337696665.bin' '-l' '-1' '-v' '-w' '/tmp/graph3859012597337696665.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:51:39] [INFO ] Decomposing Gal with order
[2024-05-22 15:51:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:51:39] [INFO ] Removed a total of 133 redundant transitions.
[2024-05-22 15:51:39] [INFO ] Flatten gal took : 24 ms
[2024-05-22 15:51:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 10 ms.
[2024-05-22 15:51:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality3173169122555875990.gal : 6 ms
[2024-05-22 15:51:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality5138516740383538355.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3173169122555875990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5138516740383538355.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 7 LTL properties
Checking formula 0 : !((G(F("((gi7.gu182.p502<=gi7.gu182.p481)||(gi3.gi2.gi1.gi0.gi1.gu183.p486>=1))"))))
Formula 0 simplified : FG!"((gi7.gu182.p502<=gi7.gu182.p481)||(gi3.gi2.gi1.gi0.gi1.gu183.p486>=1))"
Compilation finished in 1232 ms.
Running link step : cd /tmp/ltsmin4508925313653613619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4508925313653613619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin4508925313653613619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'

========== file over 1MB has been truncated ======
retrieve it from the run archives if needed

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132900555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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