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.r091-tall-171624188300724.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DES-PT-40b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 115K 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 DES-PT-40b-LTLFireability-00
FORMULA_NAME DES-PT-40b-LTLFireability-01
FORMULA_NAME DES-PT-40b-LTLFireability-02
FORMULA_NAME DES-PT-40b-LTLFireability-03
FORMULA_NAME DES-PT-40b-LTLFireability-04
FORMULA_NAME DES-PT-40b-LTLFireability-05
FORMULA_NAME DES-PT-40b-LTLFireability-06
FORMULA_NAME DES-PT-40b-LTLFireability-07
FORMULA_NAME DES-PT-40b-LTLFireability-08
FORMULA_NAME DES-PT-40b-LTLFireability-09
FORMULA_NAME DES-PT-40b-LTLFireability-10
FORMULA_NAME DES-PT-40b-LTLFireability-11
FORMULA_NAME DES-PT-40b-LTLFireability-12
FORMULA_NAME DES-PT-40b-LTLFireability-13
FORMULA_NAME DES-PT-40b-LTLFireability-14
FORMULA_NAME DES-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716323711059

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 20:35:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 20:35:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:35:12] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-21 20:35:12] [INFO ] Transformed 439 places.
[2024-05-21 20:35:12] [INFO ] Transformed 390 transitions.
[2024-05-21 20:35:12] [INFO ] Found NUPN structural information;
[2024-05-21 20:35:12] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-40b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 414 transition count 368
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 414 transition count 368
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 401 transition count 355
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 401 transition count 355
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 83 place count 401 transition count 345
Applied a total of 83 rules in 115 ms. Remains 401 /439 variables (removed 38) and now considering 345/390 (removed 45) transitions.
// Phase 1: matrix 345 rows 401 cols
[2024-05-21 20:35:12] [INFO ] Computed 62 invariants in 40 ms
[2024-05-21 20:35:13] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-21 20:35:13] [INFO ] Invariant cache hit.
[2024-05-21 20:35:13] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
Running 344 sub problems to find dead transitions.
[2024-05-21 20:35:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (OVERLAPS) 345/746 variables, 401/463 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-21 20:35:22] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 26 ms to minimize.
[2024-05-21 20:35:22] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:35:22] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:35:22] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:35:23] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:35:23] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:35:23] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-21 20:35:23] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-21 20:35:23] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:35:23] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-05-21 20:35:23] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-21 20:35:23] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:35:23] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:35:23] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:35:24] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:35:24] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:35:24] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-21 20:35:24] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:35:24] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-21 20:35:24] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 20/483 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-21 20:35:29] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:35:29] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:35:29] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:35:30] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:35:30] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:35:30] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 20:35:30] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:35:30] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:35:30] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:35:30] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-21 20:35:30] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:35:31] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-21 20:35:31] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 13/496 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-21 20:35:36] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 3 ms to minimize.
[2024-05-21 20:35:36] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 4 ms to minimize.
[2024-05-21 20:35:36] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:35:36] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:35:37] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-05-21 20:35:37] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/746 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:35:41] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-21 20:35:42] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 746/746 variables, and 507 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 44/106 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-21 20:35:46] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:35:46] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:35:46] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:35:47] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-21 20:35:47] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:35:47] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:35:47] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 3 ms to minimize.
[2024-05-21 20:35:47] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-21 20:35:47] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-21 20:35:48] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-21 20:35:48] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-21 20:35:48] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:35:48] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:35:48] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 20:35:48] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:35:49] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:35:49] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-21 20:35:49] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-21 20:35:49] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:35:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-21 20:35:51] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 20:35:52] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:35:52] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-21 20:35:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-21 20:35:55] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 9 (OVERLAPS) 345/746 variables, 401/532 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/746 variables, 344/876 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/746 variables, and 876 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 69/69 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Starting structural reductions in LTL mode, iteration 1 : 401/439 places, 345/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61344 ms. Remains : 401/439 places, 345/390 transitions.
Support contains 49 out of 401 places after structural reductions.
[2024-05-21 20:36:14] [INFO ] Flatten gal took : 53 ms
[2024-05-21 20:36:14] [INFO ] Flatten gal took : 25 ms
[2024-05-21 20:36:14] [INFO ] Input system was already deterministic with 345 transitions.
Support contains 48 out of 401 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (360 resets) in 2180 ms. (18 steps per ms) remains 14/34 properties
BEST_FIRST walk for 40003 steps (61 resets) in 194 ms. (205 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (58 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (47 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (60 resets) in 203 ms. (196 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (53 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (66 resets) in 89 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (63 resets) in 187 ms. (212 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 69 ms. (571 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (63 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (54 resets) in 72 ms. (548 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (53 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (62 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
[2024-05-21 20:36:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 37/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 123/181 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 199/380 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 6/386 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 332/718 variables, 386/448 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 20:36:16] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:36:16] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:36:16] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:36:16] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
Problem AtomicPropp2 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/718 variables, 4/452 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-21 20:36:17] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:36:17] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/718 variables, 2/454 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/718 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 18/736 variables, 10/464 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-21 20:36:18] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:36:18] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/736 variables, 2/466 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 6/742 variables, 3/469 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/742 variables, 0/469 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 2/744 variables, 1/470 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/744 variables, 0/470 constraints. Problems are: Problem set: 1 solved, 13 unsolved
SMT process timed out in 5034ms, After SMT, problems are : Problem set: 1 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 395 transition count 327
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 382 transition count 327
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 382 transition count 315
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 370 transition count 315
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 368 transition count 313
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 368 transition count 313
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 366 transition count 311
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 366 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 64 place count 366 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 365 transition count 308
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 9 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 211 place count 292 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 292 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 218 place count 289 transition count 249
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 219 place count 289 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 220 place count 288 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 221 place count 287 transition count 247
Applied a total of 221 rules in 191 ms. Remains 287 /401 variables (removed 114) and now considering 247/345 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 287/401 places, 247/345 transitions.
RANDOM walk for 40000 steps (1464 resets) in 707 ms. (56 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (270 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (276 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (279 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (268 resets) in 247 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (289 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (302 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (269 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (294 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (268 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (276 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (254 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (270 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (267 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 427123 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :2 out of 13
Probabilistic random walk after 427123 steps, saw 96973 distinct states, run finished after 3007 ms. (steps per millisecond=142 ) properties seen :2
// Phase 1: matrix 247 rows 287 cols
[2024-05-21 20:36:24] [INFO ] Computed 61 invariants in 7 ms
[2024-05-21 20:36:24] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 18/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 73/109 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 137/246 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/247 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 247/494 variables, 247/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 21/328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 40/534 variables, 40/368 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/534 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 369 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1459 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 287/287 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 18/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 73/109 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 137/246 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/247 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 247/494 variables, 247/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 21/328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 9/337 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 20:36:27] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-21 20:36:28] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-21 20:36:28] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:36:28] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-21 20:36:28] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:36:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 40/534 variables, 40/383 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 0/534 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 386 constraints, problems are : Problem set: 0 solved, 11 unsolved in 9850 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 287/287 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 6/6 constraints]
After SMT, in 11339ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 32618 ms.
Support contains 18 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 247/247 transitions.
Applied a total of 0 rules in 11 ms. Remains 287 /287 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 287/287 places, 247/247 transitions.
RANDOM walk for 40000 steps (1458 resets) in 287 ms. (138 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (284 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (265 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (276 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (295 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (251 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (290 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (269 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (268 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (271 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (264 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (292 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 493243 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :2 out of 11
Probabilistic random walk after 493243 steps, saw 111869 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :2
[2024-05-21 20:37:12] [INFO ] Invariant cache hit.
[2024-05-21 20:37:12] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 78/107 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 138/245 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/246 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 247/493 variables, 246/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 21/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:12] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:13] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/493 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 41/534 variables, 41/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/534 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 371 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1786 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 287/287 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 78/107 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 138/245 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:14] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/246 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 247/493 variables, 246/309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 21/330 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/493 variables, 8/338 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:15] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-21 20:37:15] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/493 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:15] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 41/534 variables, 41/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:37:17] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:37:17] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/534 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 387 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4899 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 287/287 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 9/9 constraints]
After SMT, in 6703ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 21907 ms.
Support contains 15 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 246
Applied a total of 1 rules in 21 ms. Remains 286 /287 variables (removed 1) and now considering 246/247 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 286/287 places, 246/247 transitions.
RANDOM walk for 40000 steps (1491 resets) in 265 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (278 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (288 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (281 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (310 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (277 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (274 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (274 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (257 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (311 resets) in 72 ms. (548 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 688663 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 9
Probabilistic random walk after 688663 steps, saw 99959 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
// Phase 1: matrix 246 rows 286 cols
[2024-05-21 20:37:44] [INFO ] Computed 61 invariants in 5 ms
[2024-05-21 20:37:44] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 20/48 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 145/193 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 26/219 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 20/239 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 6/245 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 246/491 variables, 245/305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 21/326 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 41/532 variables, 41/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:45] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/532 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 369 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1538 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 286/286 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 20/48 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 145/193 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 26/219 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:46] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 20/239 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 6/245 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 246/491 variables, 245/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 21/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 8/336 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:47] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/491 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 41/532 variables, 41/378 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/532 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:48] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-05-21 20:37:48] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:49] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/532 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 20:37:50] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/532 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/532 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 0/532 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 384 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5533 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 286/286 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints]
After SMT, in 7094ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 18302 ms.
Support contains 15 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 246/246 transitions.
Applied a total of 0 rules in 9 ms. Remains 286 /286 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 286/286 places, 246/246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 246/246 transitions.
Applied a total of 0 rules in 9 ms. Remains 286 /286 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-05-21 20:38:09] [INFO ] Invariant cache hit.
[2024-05-21 20:38:10] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 20:38:10] [INFO ] Invariant cache hit.
[2024-05-21 20:38:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:38:10] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-21 20:38:10] [INFO ] Redundant transitions in 14 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-21 20:38:10] [INFO ] Invariant cache hit.
[2024-05-21 20:38:10] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 2/284 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 2/286 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 246/532 variables, 286/347 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 21/368 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:38:19] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:38:25] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/532 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:38:29] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:38:31] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:38:37] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/532 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 373 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 286/286 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 2/284 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 2/286 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 246/532 variables, 286/352 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 21/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 242/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:38:54] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:38:54] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:38:54] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:39:02] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-21 20:39:03] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 4 ms to minimize.
[2024-05-21 20:39:06] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-21 20:39:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:39:07] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 8/623 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 623 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 286/286 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 13/13 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60697 ms. Remains : 286/286 places, 246/246 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 217 stabilizing places and 209 stable transitions
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.16 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 U p1)||G(p2))))'
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 398 transition count 342
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 398 transition count 342
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 395 transition count 339
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 395 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 395 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 394 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 394 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 394 transition count 334
Applied a total of 18 rules in 19 ms. Remains 394 /401 variables (removed 7) and now considering 334/345 (removed 11) transitions.
// Phase 1: matrix 334 rows 394 cols
[2024-05-21 20:39:11] [INFO ] Computed 62 invariants in 8 ms
[2024-05-21 20:39:11] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-21 20:39:11] [INFO ] Invariant cache hit.
[2024-05-21 20:39:11] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-05-21 20:39:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (OVERLAPS) 334/728 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 20:39:18] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:39:19] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-21 20:39:22] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 20:39:28] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 20:39:28] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 20:39:30] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:39:30] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-21 20:39:30] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 5/464 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 20:39:31] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:39:31] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:39:32] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-21 20:39:32] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-21 20:39:32] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-21 20:39:32] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-21 20:39:32] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-21 20:39:33] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:39:33] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:39:33] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:39:33] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:39:33] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-21 20:39:34] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:39:34] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:39:34] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-21 20:39:34] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-21 20:39:34] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-21 20:39:34] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-21 20:39:35] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 19/483 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 20:39:40] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:39:40] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-21 20:39:40] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-21 20:39:40] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 3 ms to minimize.
[2024-05-21 20:39:41] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-21 20:39:41] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:39:41] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/728 variables, and 490 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 20:39:44] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:39:44] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:39:44] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:39:44] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-21 20:39:44] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:39:44] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:39:44] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 20:39:45] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:39:46] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:39:46] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 20:39:46] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:39:47] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-21 20:39:47] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-21 20:39:47] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 20:39:50] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:39:50] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-21 20:39:50] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 20:39:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 20:39:52] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-21 20:39:53] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 20:39:55] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:39:56] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 11 (OVERLAPS) 334/728 variables, 394/522 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/728 variables, 333/855 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 855 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 66/66 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 394/401 places, 334/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60822 ms. Remains : 394/401 places, 334/345 transitions.
Stuttering acceptance computed with spot in 354 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-40b-LTLFireability-01
Product exploration explored 100000 steps with 871 reset in 323 ms.
Product exploration explored 100000 steps with 902 reset in 259 ms.
Computed a total of 217 stabilizing places and 209 stable transitions
Graph (complete) has 887 edges and 394 vertex of which 388 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Computed a total of 217 stabilizing places and 209 stable transitions
Detected a total of 217/394 stabilizing places and 209/334 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 211 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (345 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (63 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1392634 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :0 out of 1
Probabilistic random walk after 1392634 steps, saw 222988 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
[2024-05-21 20:40:16] [INFO ] Invariant cache hit.
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) 250/252 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/353 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/379 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 321/700 variables, 379/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/700 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/718 variables, 10/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/718 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/724 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/728 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/728 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 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) 250/252 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/353 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:40:16] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/379 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 321/700 variables, 379/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:40:16] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:40:16] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:40:17] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/718 variables, 10/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/718 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/724 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/724 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/726 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/726 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/728 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/728 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/728 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 728/728 variables, and 461 constraints, problems are : Problem set: 0 solved, 1 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1082ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 533 ms.
Support contains 2 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 334/334 transitions.
Graph (complete) has 887 edges and 394 vertex of which 388 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 388 transition count 314
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 373 transition count 314
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 33 place count 373 transition count 301
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 360 transition count 301
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 209 place count 285 transition count 226
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 215 place count 282 transition count 234
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 282 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 281 transition count 233
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 281 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 280 transition count 232
Applied a total of 219 rules in 51 ms. Remains 280 /394 variables (removed 114) and now considering 232/334 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 280/394 places, 232/334 transitions.
RANDOM walk for 40000 steps (1748 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (349 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1599963 steps, run timeout after 3001 ms. (steps per millisecond=533 ) properties seen :0 out of 1
Probabilistic random walk after 1599963 steps, saw 218677 distinct states, run finished after 3001 ms. (steps per millisecond=533 ) properties seen :0
// Phase 1: matrix 232 rows 280 cols
[2024-05-21 20:40:20] [INFO ] Computed 61 invariants in 9 ms
[2024-05-21 20:40:20] [INFO ] State equation strengthened by 14 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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/187 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 190/420 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 14/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/431 variables, 8/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/473 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/473 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/473 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/512 variables, 39/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/512 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/512 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 355 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 14/14 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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/187 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 190/420 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 14/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:40:21] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:40:21] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 20:40:21] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/431 variables, 8/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/431 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/431 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/473 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/473 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/473 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/512 variables, 39/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/512 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/512 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 625ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 238 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 232/232 transitions.
Applied a total of 0 rules in 20 ms. Remains 280 /280 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 280/280 places, 232/232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 232/232 transitions.
Applied a total of 0 rules in 13 ms. Remains 280 /280 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2024-05-21 20:40:21] [INFO ] Invariant cache hit.
[2024-05-21 20:40:21] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 20:40:21] [INFO ] Invariant cache hit.
[2024-05-21 20:40:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-21 20:40:22] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-05-21 20:40:22] [INFO ] Redundant transitions in 4 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-21 20:40:22] [INFO ] Invariant cache hit.
[2024-05-21 20:40:22] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 1/279 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 232/511 variables, 279/340 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 1/512 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-21 20:40:36] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:40:36] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-21 20:40:36] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:40:37] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-21 20:40:39] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 14 (OVERLAPS) 0/512 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 360 constraints, problems are : Problem set: 0 solved, 229 unsolved in 26058 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 1/279 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-21 20:40:51] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 232/511 variables, 279/346 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 14/360 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 229/589 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-21 20:41:00] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-21 20:41:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/512 variables, and 591 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/280 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 8/8 constraints]
After SMT, in 56200ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 56204ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56690 ms. Remains : 280/280 places, 232/232 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 960 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 279 transition count 232
Applied a total of 2 rules in 11 ms. Remains 279 /280 variables (removed 1) and now considering 232/232 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 279 cols
[2024-05-21 20:41:18] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 20:41:18] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:41:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 20:41:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 20:41:18] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 20:41:18] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-21 20:41:18] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-21 20:41:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
TRAPS : Iteration 1
[2024-05-21 20:41:18] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:41:18] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 479 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 164 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 86 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p2)]
Support contains 2 out of 394 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 : 394/394 places, 334/334 transitions.
Graph (complete) has 887 edges and 394 vertex of which 388 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 387 transition count 317
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 374 transition count 317
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 374 transition count 305
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 362 transition count 305
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 197 place count 289 transition count 232
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 287 transition count 234
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 285 transition count 232
Applied a total of 203 rules in 41 ms. Remains 285 /394 variables (removed 109) and now considering 232/334 (removed 102) transitions.
// Phase 1: matrix 232 rows 285 cols
[2024-05-21 20:41:19] [INFO ] Computed 59 invariants in 3 ms
[2024-05-21 20:41:19] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 20:41:19] [INFO ] Invariant cache hit.
[2024-05-21 20:41:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 20:41:19] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-21 20:41:19] [INFO ] Redundant transitions in 4 ms returned []
Running 228 sub problems to find dead transitions.
[2024-05-21 20:41:19] [INFO ] Invariant cache hit.
[2024-05-21 20:41:19] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 2/283 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 232/516 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 1/517 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 12 (OVERLAPS) 0/517 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 352 constraints, problems are : Problem set: 0 solved, 228 unsolved in 16383 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 2/283 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 232/516 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 228/579 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 20:41:48] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:41:49] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-21 20:41:50] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:41:50] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:41:50] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:41:50] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-21 20:41:57] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 7/586 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/517 variables, and 586 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 284/285 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 7/7 constraints]
After SMT, in 46539ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 46542ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/394 places, 232/334 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47126 ms. Remains : 285/394 places, 232/334 transitions.
Computed a total of 179 stabilizing places and 173 stable transitions
Computed a total of 179 stabilizing places and 173 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
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 44 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (1717 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (347 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1540530 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :0 out of 1
Probabilistic random walk after 1540530 steps, saw 208508 distinct states, run finished after 3001 ms. (steps per millisecond=513 ) properties seen :0
[2024-05-21 20:42:09] [INFO ] Invariant cache hit.
[2024-05-21 20:42:09] [INFO ] State equation strengthened by 8 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, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/154 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/189 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 36/225 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/236 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 190/426 variables, 236/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 8/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/435 variables, 7/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/435 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/435 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/477 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/477 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/477 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 40/517 variables, 40/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/517 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/517 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 352 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 8/8 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, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/154 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/189 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 36/225 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/236 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 190/426 variables, 236/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 8/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/435 variables, 7/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/435 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/435 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/477 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/477 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/477 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 40/517 variables, 40/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/517 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/517 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 353 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 231 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 232/232 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 1 place count 285 transition count 231
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 282 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 282 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 281 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 281 transition count 227
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 278 transition count 225
Applied a total of 13 rules in 34 ms. Remains 278 /285 variables (removed 7) and now considering 225/232 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 278/285 places, 225/232 transitions.
RANDOM walk for 40000 steps (1911 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (408 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1603002 steps, run timeout after 3001 ms. (steps per millisecond=534 ) properties seen :0 out of 1
Probabilistic random walk after 1603002 steps, saw 219274 distinct states, run finished after 3001 ms. (steps per millisecond=534 ) properties seen :0
// Phase 1: matrix 225 rows 278 cols
[2024-05-21 20:42:13] [INFO ] Computed 59 invariants in 5 ms
[2024-05-21 20:42:13] [INFO ] State equation strengthened by 6 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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 183/413 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/422 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/464 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/464 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/464 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/503 variables, 39/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/503 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/503 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 183/413 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/422 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/464 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/464 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/464 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/503 variables, 39/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/503 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/503 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 215 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-21 20:42:14] [INFO ] Invariant cache hit.
[2024-05-21 20:42:14] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-21 20:42:14] [INFO ] Invariant cache hit.
[2024-05-21 20:42:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:42:15] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-05-21 20:42:15] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-21 20:42:15] [INFO ] Invariant cache hit.
[2024-05-21 20:42:15] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 1/276 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 1/277 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 225/502 variables, 277/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 20:42:23] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 20:42:27] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 12 (OVERLAPS) 1/503 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 20:42:32] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-21 20:42:33] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 20:42:37] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:42:37] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-21 20:42:38] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/503 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 17 (OVERLAPS) 0/503 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 350 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/276 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 1/277 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 225/502 variables, 277/343 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 6/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 222/571 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 20:43:02] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/503 variables, and 572 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 8/8 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60779 ms. Remains : 278/278 places, 225/225 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 225
Applied a total of 1 rules in 9 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2024-05-21 20:43:15] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 20:43:15] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:43:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 20:43:15] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 20:43:15] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 20:43:15] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:43:15] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 313 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 42 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 4240 reset in 203 ms.
Product exploration explored 100000 steps with 4295 reset in 225 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 232/232 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 281 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 31 ms. Remains 279 /285 variables (removed 6) and now considering 227/232 (removed 5) transitions.
// Phase 1: matrix 227 rows 279 cols
[2024-05-21 20:43:16] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 20:43:16] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-21 20:43:16] [INFO ] Invariant cache hit.
[2024-05-21 20:43:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:43:16] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2024-05-21 20:43:16] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2024-05-21 20:43:16] [INFO ] Invariant cache hit.
[2024-05-21 20:43:16] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 1/277 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 1/278 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 227/505 variables, 278/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 1/506 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 20:43:28] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 20:43:30] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:43:31] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-21 20:43:31] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 20:43:35] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/506 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 16 (OVERLAPS) 0/506 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 348 constraints, problems are : Problem set: 0 solved, 224 unsolved in 26848 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 1/277 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 1/278 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 227/505 variables, 278/341 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 224/571 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 20:43:55] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 20:43:55] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 573 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/279 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 7/7 constraints]
After SMT, in 57009ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 57012ms
Starting structural reductions in SI_LTL mode, iteration 1 : 279/285 places, 227/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57662 ms. Remains : 279/285 places, 227/232 transitions.
Treatment of property DES-PT-40b-LTLFireability-01 finished in 302937 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||(X((p0&&G(p2)))&&p1))))'
Support contains 1 out of 401 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 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 382 transition count 318
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 371 transition count 318
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 367 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 367 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 367 transition count 313
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 57 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 363 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 363 transition count 305
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 361 transition count 304
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 221 place count 286 transition count 229
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 284 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 283 transition count 230
Applied a total of 226 rules in 61 ms. Remains 283 /401 variables (removed 118) and now considering 230/345 (removed 115) transitions.
// Phase 1: matrix 230 rows 283 cols
[2024-05-21 20:44:13] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 20:44:14] [INFO ] Implicit Places using invariants in 281 ms returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 284 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/401 places, 230/345 transitions.
Applied a total of 0 rules in 5 ms. Remains 282 /282 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 351 ms. Remains : 282/401 places, 230/345 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Computed a total of 178 stabilizing places and 173 stable transitions
Computed a total of 178 stabilizing places and 173 stable transitions
Detected a total of 178/282 stabilizing places and 173/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLFireability-03 finished in 925 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(F((p0&&F(p1)))))'
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 20 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-21 20:44:14] [INFO ] Computed 62 invariants in 11 ms
[2024-05-21 20:44:15] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 20:44:15] [INFO ] Invariant cache hit.
[2024-05-21 20:44:15] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 20:44:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:44:20] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:44:21] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:44:21] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 2 ms to minimize.
[2024-05-21 20:44:21] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:44:21] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:44:21] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-21 20:44:21] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:44:22] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:44:22] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:44:22] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:44:22] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:44:23] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:44:23] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-21 20:44:23] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-21 20:44:24] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:44:29] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:44:29] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:44:30] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-21 20:44:30] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:44:30] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:44:30] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-21 20:44:30] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:44:30] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:44:30] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:44:34] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:44:34] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:44:34] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:44:34] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 20:44:34] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-21 20:44:34] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-05-21 20:44:34] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-21 20:44:34] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 4 ms to minimize.
[2024-05-21 20:44:36] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:44:40] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:44:44] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:44:45] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:44:48] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:44:48] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:44:48] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:44:48] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-21 20:44:48] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:44:49] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 20:44:49] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-21 20:44:49] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:44:49] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:44:51] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:44:51] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:44:52] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:44:52] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:44:52] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:44:55] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-21 20:44:57] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:44:58] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:44:58] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60862 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-04
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-04 finished in 61018 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) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0))))))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 30 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
[2024-05-21 20:45:15] [INFO ] Invariant cache hit.
[2024-05-21 20:45:16] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 20:45:16] [INFO ] Invariant cache hit.
[2024-05-21 20:45:16] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 20:45:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:45:22] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:45:22] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-21 20:45:22] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 2 ms to minimize.
[2024-05-21 20:45:22] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-21 20:45:23] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-21 20:45:23] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:45:23] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:45:23] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-21 20:45:23] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-21 20:45:24] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-21 20:45:24] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:45:24] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:45:25] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2024-05-21 20:45:25] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:45:26] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:45:31] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:45:31] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:45:32] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-21 20:45:32] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:45:32] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:45:32] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:45:32] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-21 20:45:32] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-21 20:45:32] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:45:36] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-21 20:45:36] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:45:36] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-21 20:45:36] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 20:45:36] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-21 20:45:36] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:45:37] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:45:37] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:45:39] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:45:43] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 489 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:45:49] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 20:45:49] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:45:49] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:45:49] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:45:49] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:45:49] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:45:49] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-21 20:45:50] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 20:45:50] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:45:50] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 20:45:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 20:45:50] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:45:50] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-21 20:45:50] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:45:50] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 20:45:50] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-21 20:45:51] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:45:51] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:45:52] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 19/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:45:53] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:45:53] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:45:53] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:45:53] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:45:53] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:45:54] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:45:56] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (OVERLAPS) 333/726 variables, 393/515 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/726 variables, 332/847 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 847 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 60/60 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60908 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, p1, p0, p0, (AND p0 p1), p0, p0]
Running random walk in product with property : DES-PT-40b-LTLFireability-05
Product exploration explored 100000 steps with 901 reset in 295 ms.
Product exploration explored 100000 steps with 885 reset in 217 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 223 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (351 resets) in 160 ms. (248 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (59 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2024-05-21 20:46:18] [INFO ] Invariant cache hit.
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) 244/246 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 104/350 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/378 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/698 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/716 variables, 10/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/716 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/722 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/722 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/724 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 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) 244/246 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/350 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/378 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/698 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:46:18] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-21 20:46:18] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/698 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/716 variables, 10/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/722 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/724 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/726 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 458 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 938ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 227 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 47 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 278/393 places, 224/333 transitions.
RANDOM walk for 40000 steps (1759 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (370 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1591591 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :0 out of 1
Probabilistic random walk after 1591591 steps, saw 217436 distinct states, run finished after 3001 ms. (steps per millisecond=530 ) properties seen :0
// Phase 1: matrix 224 rows 278 cols
[2024-05-21 20:46:22] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 20:46:22] [INFO ] State equation strengthened by 6 read => feed constraints.
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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 182/412 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/421 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/463 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/463 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/502 variables, 39/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 182/412 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/421 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/421 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/463 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/463 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/502 variables, 39/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/502 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/502 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-21 20:46:23] [INFO ] Invariant cache hit.
[2024-05-21 20:46:23] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 20:46:23] [INFO ] Invariant cache hit.
[2024-05-21 20:46:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:46:23] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-21 20:46:23] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-21 20:46:23] [INFO ] Invariant cache hit.
[2024-05-21 20:46:23] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 1/276 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 1/277 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 224/501 variables, 277/337 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 20:46:31] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 20:46:35] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 1/502 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (OVERLAPS) 0/502 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 346 constraints, problems are : Problem set: 0 solved, 221 unsolved in 21375 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/276 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 1/277 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 224/501 variables, 277/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 221/566 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 20:46:57] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 20:46:57] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:46:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-21 20:47:02] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-21 20:47:02] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:47:02] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:47:07] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 7/573 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/502 variables, and 573 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 9/9 constraints]
After SMT, in 51507ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 51511ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51981 ms. Remains : 278/278 places, 224/224 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 224
Applied a total of 1 rules in 9 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2024-05-21 20:47:15] [INFO ] Computed 60 invariants in 5 ms
[2024-05-21 20:47:15] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 20:47:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 20:47:15] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:47:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 20:47:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 20:47:15] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 20:47:15] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:47:15] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 324 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 267 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 181 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 14 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-21 20:47:16] [INFO ] Computed 62 invariants in 11 ms
[2024-05-21 20:47:16] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 20:47:16] [INFO ] Invariant cache hit.
[2024-05-21 20:47:16] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 20:47:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:47:21] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 20:47:22] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:47:22] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-05-21 20:47:22] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-21 20:47:22] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 20:47:22] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:47:23] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:47:23] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:47:23] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:47:23] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-21 20:47:23] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-21 20:47:24] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:47:24] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-21 20:47:24] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-21 20:47:26] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:47:30] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 20:47:31] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:47:31] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-21 20:47:31] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-21 20:47:31] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:47:31] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:47:31] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:47:31] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-21 20:47:31] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:47:35] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 3 ms to minimize.
[2024-05-21 20:47:35] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-21 20:47:35] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 20:47:35] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 20:47:35] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-21 20:47:35] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-21 20:47:35] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-05-21 20:47:35] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-21 20:47:37] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:47:42] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:47:45] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:47:45] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:47:45] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:47:45] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-21 20:47:45] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-21 20:47:46] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:47:46] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:47:46] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:47:46] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:47:46] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:47:46] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:47:46] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:47:49] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:47:49] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:47:49] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:47:49] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:47:49] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-21 20:47:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-21 20:47:50] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-21 20:47:50] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:47:50] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:47:52] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-21 20:47:52] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:47:53] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-21 20:47:53] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:47:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:47:56] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-21 20:47:58] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:47:59] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2024-05-21 20:47:59] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in LTL mode , in 1 iterations and 60793 ms. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (358 resets) in 131 ms. (303 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (66 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2024-05-21 20:48:17] [INFO ] Invariant cache hit.
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) 244/246 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 104/350 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/378 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/698 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/716 variables, 10/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/716 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/722 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/722 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/724 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 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) 244/246 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/350 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/378 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/698 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:48:17] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 20:48:17] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/698 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/716 variables, 10/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/722 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/724 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/726 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 458 constraints, problems are : Problem set: 0 solved, 1 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 918ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 224 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 36 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 278/393 places, 224/333 transitions.
RANDOM walk for 40000 steps (1763 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (376 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1544145 steps, run timeout after 3001 ms. (steps per millisecond=514 ) properties seen :0 out of 1
Probabilistic random walk after 1544145 steps, saw 210776 distinct states, run finished after 3001 ms. (steps per millisecond=514 ) properties seen :0
// Phase 1: matrix 224 rows 278 cols
[2024-05-21 20:48:21] [INFO ] Computed 60 invariants in 6 ms
[2024-05-21 20:48:21] [INFO ] State equation strengthened by 6 read => feed constraints.
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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 182/412 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/421 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/463 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/463 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/502 variables, 39/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 182/412 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/421 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/421 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/463 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/463 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/502 variables, 39/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/502 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/502 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-21 20:48:22] [INFO ] Invariant cache hit.
[2024-05-21 20:48:22] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-21 20:48:22] [INFO ] Invariant cache hit.
[2024-05-21 20:48:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:48:22] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2024-05-21 20:48:22] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-21 20:48:22] [INFO ] Invariant cache hit.
[2024-05-21 20:48:22] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 1/276 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 1/277 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 224/501 variables, 277/337 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 20:48:30] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 20:48:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 1/502 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (OVERLAPS) 0/502 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 346 constraints, problems are : Problem set: 0 solved, 221 unsolved in 20505 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/276 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 1/277 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 224/501 variables, 277/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 221/566 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 20:48:55] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-21 20:48:55] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:48:56] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:49:00] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:49:00] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-21 20:49:00] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:49:05] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 7/573 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/502 variables, and 573 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 9/9 constraints]
After SMT, in 50638ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 50639ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51342 ms. Remains : 278/278 places, 224/224 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 224
Applied a total of 1 rules in 7 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2024-05-21 20:49:13] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 20:49:13] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 20:49:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-21 20:49:13] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:49:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 20:49:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-21 20:49:13] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 20:49:13] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:49:13] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 301 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 151 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 151 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 868 reset in 179 ms.
Product exploration explored 100000 steps with 893 reset in 201 ms.
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 11 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-21 20:49:14] [INFO ] Computed 62 invariants in 6 ms
[2024-05-21 20:49:15] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 20:49:15] [INFO ] Invariant cache hit.
[2024-05-21 20:49:15] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 20:49:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:49:20] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:49:21] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-05-21 20:49:21] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:49:21] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:49:21] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:49:21] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:49:21] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:49:22] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:49:22] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-21 20:49:22] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-21 20:49:22] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:49:23] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:49:23] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-21 20:49:23] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 20:49:25] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:49:30] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:49:30] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:49:30] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 3 ms to minimize.
[2024-05-21 20:49:30] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:49:30] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:49:30] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:49:31] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
[2024-05-21 20:49:31] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-21 20:49:31] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:49:34] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-21 20:49:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:49:34] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:49:34] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-21 20:49:34] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-21 20:49:35] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:49:35] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 3 ms to minimize.
[2024-05-21 20:49:35] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2024-05-21 20:49:37] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:49:41] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:49:44] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:49:44] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-21 20:49:44] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-21 20:49:45] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 20:49:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-21 20:49:45] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:49:45] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:49:45] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:49:45] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:49:45] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:49:45] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:49:45] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:49:48] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 20:49:48] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:49:48] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:49:48] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:49:48] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:49:49] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-21 20:49:49] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-21 20:49:49] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-21 20:49:49] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-21 20:49:51] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:49:51] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:49:52] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-21 20:49:52] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:49:52] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:49:55] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:49:57] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 20:49:57] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-05-21 20:49:58] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Finished structural reductions in LTL mode , in 1 iterations and 60783 ms. Remains : 393/393 places, 333/333 transitions.
Treatment of property DES-PT-40b-LTLFireability-05 finished in 299859 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(G((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
Support contains 9 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 394 transition count 328
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 381 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 381 transition count 317
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 366 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 366 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 57 place count 366 transition count 312
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 365 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 362 transition count 309
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 362 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 70 place count 362 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 360 transition count 303
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 225 place count 284 transition count 227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 229 place count 282 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 279 transition count 227
Applied a total of 232 rules in 59 ms. Remains 279 /401 variables (removed 122) and now considering 227/345 (removed 118) transitions.
// Phase 1: matrix 227 rows 279 cols
[2024-05-21 20:50:15] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 20:50:15] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 20:50:15] [INFO ] Invariant cache hit.
[2024-05-21 20:50:16] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-05-21 20:50:16] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2024-05-21 20:50:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/278 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 227/505 variables, 278/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 20:50:20] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-21 20:50:21] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 20:50:21] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 20:50:24] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:50:24] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-21 20:50:25] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 1/506 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 343 constraints, problems are : Problem set: 0 solved, 224 unsolved in 18617 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/278 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 227/505 variables, 278/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 224/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
SMT process timed out in 48756ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 48758ms
Starting structural reductions in SI_LTL mode, iteration 1 : 279/401 places, 227/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49303 ms. Remains : 279/401 places, 227/345 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-06
Product exploration explored 100000 steps with 33419 reset in 206 ms.
Product exploration explored 100000 steps with 33249 reset in 259 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 276 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (2127 resets) in 148 ms. (268 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (409 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
[2024-05-21 20:51:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/122 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/151 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/210 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/219 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/225 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 181/406 variables, 225/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/420 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 45/465 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/465 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/466 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/466 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/466 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 40/506 variables, 40/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/506 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/506 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 122/506 variables, and 17 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/33 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/279 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 261ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p2 p1))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 389 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 9 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-21 20:51:07] [INFO ] Invariant cache hit.
[2024-05-21 20:51:07] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-21 20:51:07] [INFO ] Invariant cache hit.
[2024-05-21 20:51:07] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-21 20:51:07] [INFO ] Redundant transitions in 0 ms returned []
Running 224 sub problems to find dead transitions.
[2024-05-21 20:51:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/278 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 227/505 variables, 278/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 20:51:11] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:51:13] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:51:13] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 20:51:15] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-21 20:51:15] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:51:16] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 1/506 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 343 constraints, problems are : Problem set: 0 solved, 224 unsolved in 18457 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/278 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 227/505 variables, 278/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 224/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
SMT process timed out in 48581ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 48583ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49140 ms. Remains : 279/279 places, 227/227 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 1580 steps (83 resets) in 11 ms. (131 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p1), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 6117 reset in 189 ms.
Product exploration explored 100000 steps with 6202 reset in 258 ms.
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-21 20:51:57] [INFO ] Invariant cache hit.
[2024-05-21 20:51:57] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 20:51:57] [INFO ] Invariant cache hit.
[2024-05-21 20:51:57] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-21 20:51:57] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2024-05-21 20:51:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/278 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 227/505 variables, 278/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 20:52:02] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:52:03] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:52:03] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 20:52:06] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:52:06] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:52:07] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 1/506 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 343 constraints, problems are : Problem set: 0 solved, 224 unsolved in 18765 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/278 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 227/505 variables, 278/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 224/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
SMT process timed out in 48878ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 48880ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49380 ms. Remains : 279/279 places, 227/227 transitions.
Treatment of property DES-PT-40b-LTLFireability-06 finished in 150988 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)) U (p1||(p1 U p2))))'
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 382 transition count 318
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 371 transition count 318
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 367 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 367 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 367 transition count 313
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 57 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 363 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 363 transition count 305
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 361 transition count 304
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 219 place count 287 transition count 230
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 285 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 283 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 226 place count 282 transition count 230
Applied a total of 226 rules in 32 ms. Remains 282 /401 variables (removed 119) and now considering 230/345 (removed 115) transitions.
// Phase 1: matrix 230 rows 282 cols
[2024-05-21 20:52:46] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 20:52:46] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-21 20:52:46] [INFO ] Invariant cache hit.
[2024-05-21 20:52:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:52:47] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2024-05-21 20:52:47] [INFO ] Redundant transitions in 1 ms returned []
Running 227 sub problems to find dead transitions.
[2024-05-21 20:52:47] [INFO ] Invariant cache hit.
[2024-05-21 20:52:47] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 2/281 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 227 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 230/512 variables, 282/340 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 20:52:54] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-21 20:52:55] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-21 20:52:55] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 5 ms to minimize.
[2024-05-21 20:52:55] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 20:53:00] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/512 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 13 (OVERLAPS) 0/512 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 351 constraints, problems are : Problem set: 0 solved, 227 unsolved in 20862 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 2/281 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 1/282 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 230/512 variables, 282/345 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 227/578 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 20:53:23] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-21 20:53:26] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-21 20:53:28] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 581 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 8/8 constraints]
After SMT, in 51000ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 51002ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/401 places, 230/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51557 ms. Remains : 282/401 places, 230/345 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-07
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-07 finished in 51674 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' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(p2)&&F(p3)&&(!p0 U (p1||G(!p0)))))))'
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 394 transition count 331
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 384 transition count 331
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 21 place count 384 transition count 319
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 45 place count 372 transition count 319
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 370 transition count 317
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 368 transition count 315
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 368 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 56 place count 368 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 367 transition count 312
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 211 place count 290 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 290 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 218 place count 287 transition count 249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 285 transition count 247
Applied a total of 220 rules in 71 ms. Remains 285 /401 variables (removed 116) and now considering 247/345 (removed 98) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-21 20:53:38] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 20:53:38] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-21 20:53:38] [INFO ] Invariant cache hit.
[2024-05-21 20:53:38] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:53:39] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2024-05-21 20:53:39] [INFO ] Redundant transitions in 1 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-21 20:53:39] [INFO ] Invariant cache hit.
[2024-05-21 20:53:39] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 1/283 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 247/531 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-21 20:53:47] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:53:49] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 11 (OVERLAPS) 1/532 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 13 (OVERLAPS) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 367 constraints, problems are : Problem set: 0 solved, 244 unsolved in 20631 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 1/284 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 247/531 variables, 284/345 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 21/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 244/610 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-21 20:54:23] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-21 20:54:23] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-05-21 20:54:23] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-21 20:54:23] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:54:23] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-21 20:54:26] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:54:26] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:54:28] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:54:29] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:54:29] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 620 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 284/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 12/12 constraints]
After SMT, in 50776ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 50778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/401 places, 247/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51674 ms. Remains : 285/401 places, 247/345 transitions.
Stuttering acceptance computed with spot in 350 ms :[(AND p0 (NOT p1)), true, (AND (NOT p2) (NOT p1) p0), (AND (NOT p3) (NOT p1) p0), (AND (NOT p1) p0), (NOT p2), (NOT p3)]
Running random walk in product with property : DES-PT-40b-LTLFireability-08
Product exploration explored 100000 steps with 5142 reset in 261 ms.
Product exploration explored 100000 steps with 5114 reset in 308 ms.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3)))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 180 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (NOT p2)]
RANDOM walk for 40000 steps (1952 resets) in 369 ms. (108 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (362 resets) in 673 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (361 resets) in 492 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (363 resets) in 451 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (383 resets) in 386 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (354 resets) in 383 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (334 resets) in 358 ms. (111 steps per ms) remains 6/6 properties
[2024-05-21 20:54:32] [INFO ] Invariant cache hit.
[2024-05-21 20:54:32] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 21/227 variables, 18/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/234 variables, 3/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 205/439 variables, 234/290 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 21/311 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/311 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/450 variables, 9/320 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/322 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/322 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 42/492 variables, 2/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 1/325 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/492 variables, 0/325 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 40/532 variables, 40/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 365 constraints, problems are : Problem set: 2 solved, 4 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 21/227 variables, 18/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/234 variables, 3/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 205/439 variables, 234/290 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 21/311 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 4/315 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/315 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 11/450 variables, 9/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 2/326 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-21 20:54:33] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 1/327 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 0/327 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 42/492 variables, 2/329 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/492 variables, 1/330 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/492 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 40/532 variables, 40/370 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 0/370 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/532 variables, 0/370 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 370 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1781ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8423 ms.
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 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 1 place count 285 transition count 246
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 285 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 284 transition count 245
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 284 transition count 245
Applied a total of 4 rules in 20 ms. Remains 284 /285 variables (removed 1) and now considering 245/247 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 284/285 places, 245/247 transitions.
RANDOM walk for 40000 steps (1895 resets) in 1307 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (384 resets) in 329 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (358 resets) in 387 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (364 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (363 resets) in 409 ms. (97 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 639045 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 4
Probabilistic random walk after 639045 steps, saw 86668 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
// Phase 1: matrix 245 rows 284 cols
[2024-05-21 20:54:46] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 20:54:46] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 25/231 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/234 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 203/437 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 21/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/448 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 42/490 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 39/529 variables, 39/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/529 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/529 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 365 constraints, problems are : Problem set: 0 solved, 4 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 25/231 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/234 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 203/437 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 21/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 20:54:47] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 11/448 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/448 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 20:54:48] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-21 20:54:48] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/448 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/448 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 42/490 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/490 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 39/529 variables, 39/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/529 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/529 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 529/529 variables, and 372 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1379 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1962ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8972 ms.
Support contains 6 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 284 /284 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 284/284 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 245/245 transitions.
Applied a total of 0 rules in 3 ms. Remains 284 /284 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-21 20:54:57] [INFO ] Invariant cache hit.
[2024-05-21 20:54:57] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 20:54:57] [INFO ] Invariant cache hit.
[2024-05-21 20:54:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:54:58] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-21 20:54:58] [INFO ] Redundant transitions in 1 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-21 20:54:58] [INFO ] Invariant cache hit.
[2024-05-21 20:54:58] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 1/282 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 1/283 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 245/528 variables, 283/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 1/529 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:55:09] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:55:09] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:55:10] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-21 20:55:10] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:55:10] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 5/370 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:55:16] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/529 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 15 (OVERLAPS) 0/529 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 371 constraints, problems are : Problem set: 0 solved, 242 unsolved in 27346 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 1/283 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 245/528 variables, 283/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 21/369 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 242/611 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:55:42] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-21 20:55:42] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-21 20:55:42] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 20:55:48] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/529 variables, and 615 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 283/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 9/10 constraints]
After SMT, in 57514ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 57516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58070 ms. Remains : 284/284 places, 245/245 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 926 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 283 transition count 245
Applied a total of 2 rules in 7 ms. Remains 283 /284 variables (removed 1) and now considering 245/245 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 245 rows 283 cols
[2024-05-21 20:55:55] [INFO ] Computed 59 invariants in 3 ms
[2024-05-21 20:55:55] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 20:55:55] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 20:55:55] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 20:55:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 20:55:55] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 20:55:56] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 20:55:56] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
TRAPS : Iteration 1
[2024-05-21 20:55:56] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-21 20:55:56] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2024-05-21 20:55:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
TRAPS : Iteration 2
[2024-05-21 20:55:56] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 20:55:56] [INFO ] After 974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1106 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3)))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR p1 (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (F p2), (F (NOT (OR (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 24 factoid took 294 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 247/247 transitions.
Applied a total of 0 rules in 5 ms. Remains 285 /285 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-21 20:55:57] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 20:55:57] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-21 20:55:57] [INFO ] Invariant cache hit.
[2024-05-21 20:55:58] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:55:58] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-05-21 20:55:58] [INFO ] Redundant transitions in 1 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-21 20:55:58] [INFO ] Invariant cache hit.
[2024-05-21 20:55:58] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 1/283 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 247/531 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-21 20:56:06] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:56:08] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 11 (OVERLAPS) 1/532 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 13 (OVERLAPS) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 367 constraints, problems are : Problem set: 0 solved, 244 unsolved in 20673 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 1/284 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 247/531 variables, 284/345 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 21/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 244/610 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-21 20:56:42] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-21 20:56:42] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:56:42] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:56:42] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-21 20:56:42] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:56:45] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-21 20:56:45] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:56:47] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:56:48] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:56:48] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 620 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 284/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 12/12 constraints]
After SMT, in 50848ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 50850ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51554 ms. Remains : 285/285 places, 247/247 transitions.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 120 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (1939 resets) in 1166 ms. (34 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (369 resets) in 235 ms. (169 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (373 resets) in 273 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (361 resets) in 275 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (371 resets) in 282 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (349 resets) in 283 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (374 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
[2024-05-21 20:56:50] [INFO ] Invariant cache hit.
[2024-05-21 20:56:50] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 21/227 variables, 18/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/234 variables, 3/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 205/439 variables, 234/290 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 21/311 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/311 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/450 variables, 9/320 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/322 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/322 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 42/492 variables, 2/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 1/325 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/492 variables, 0/325 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 40/532 variables, 40/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 365 constraints, problems are : Problem set: 2 solved, 4 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 21/227 variables, 18/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-21 20:56:51] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:56:51] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 2/55 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/234 variables, 3/58 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 205/439 variables, 234/292 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 21/313 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 4/317 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/317 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 11/450 variables, 9/326 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 2/328 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 0/328 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 42/492 variables, 2/330 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/492 variables, 1/331 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/492 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 40/532 variables, 40/371 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 0/371 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/532 variables, 0/371 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 371 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1140 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 1697ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6880 ms.
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 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 1 place count 285 transition count 246
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 285 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 284 transition count 245
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 284 transition count 245
Applied a total of 4 rules in 17 ms. Remains 284 /285 variables (removed 1) and now considering 245/247 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 284/285 places, 245/247 transitions.
RANDOM walk for 40000 steps (1876 resets) in 866 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (352 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (374 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (356 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (359 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 643324 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 4
Probabilistic random walk after 643324 steps, saw 87270 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
// Phase 1: matrix 245 rows 284 cols
[2024-05-21 20:57:03] [INFO ] Computed 60 invariants in 10 ms
[2024-05-21 20:57:03] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 25/231 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/234 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 203/437 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 21/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/448 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 42/490 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 39/529 variables, 39/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/529 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/529 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 365 constraints, problems are : Problem set: 0 solved, 4 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 25/231 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/234 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 203/437 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 21/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 20:57:04] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 11/448 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/448 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/448 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 42/490 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 39/529 variables, 39/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/529 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/529 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 529/529 variables, and 370 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1198 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1813ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8645 ms.
Support contains 6 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 284 /284 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 284/284 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 245/245 transitions.
Applied a total of 0 rules in 3 ms. Remains 284 /284 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-21 20:57:13] [INFO ] Invariant cache hit.
[2024-05-21 20:57:13] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 20:57:13] [INFO ] Invariant cache hit.
[2024-05-21 20:57:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:57:13] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-21 20:57:13] [INFO ] Redundant transitions in 2 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-21 20:57:13] [INFO ] Invariant cache hit.
[2024-05-21 20:57:13] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 1/282 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 1/283 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 245/528 variables, 283/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 1/529 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:57:25] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:57:25] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:57:26] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:57:26] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:57:26] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 5/370 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:57:32] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/529 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 15 (OVERLAPS) 0/529 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 371 constraints, problems are : Problem set: 0 solved, 242 unsolved in 27097 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 1/283 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 245/528 variables, 283/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 21/369 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 242/611 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 20:57:57] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2024-05-21 20:57:58] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:57:58] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:58:03] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/529 variables, and 615 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 283/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 9/10 constraints]
After SMT, in 57254ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 57256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57775 ms. Remains : 284/284 places, 245/245 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 926 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 283 transition count 245
Applied a total of 2 rules in 10 ms. Remains 283 /284 variables (removed 1) and now considering 245/245 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 245 rows 283 cols
[2024-05-21 20:58:11] [INFO ] Computed 59 invariants in 4 ms
[2024-05-21 20:58:11] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 20:58:11] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 20:58:11] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 20:58:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 20:58:11] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 20:58:11] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 20:58:11] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:58:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-05-21 20:58:11] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 20:58:12] [INFO ] After 743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 862 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F p2)]
Knowledge based reduction with 22 factoid took 290 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 343 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 322 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), false, false]
Product exploration explored 100000 steps with 5171 reset in 264 ms.
Product exploration explored 100000 steps with 5161 reset in 288 ms.
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 247/247 transitions.
Applied a total of 0 rules in 4 ms. Remains 285 /285 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-21 20:58:13] [INFO ] Computed 59 invariants in 7 ms
[2024-05-21 20:58:14] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 20:58:14] [INFO ] Invariant cache hit.
[2024-05-21 20:58:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:58:14] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-05-21 20:58:14] [INFO ] Redundant transitions in 3 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-21 20:58:14] [INFO ] Invariant cache hit.
[2024-05-21 20:58:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 1/283 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 247/531 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:58:24] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 11 (OVERLAPS) 1/532 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 13 (OVERLAPS) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 367 constraints, problems are : Problem set: 0 solved, 244 unsolved in 20551 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 1/284 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 247/531 variables, 284/345 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 21/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 244/610 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-21 20:58:58] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:58:58] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:58:58] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 20:58:58] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:58:58] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:59:01] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:59:01] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:59:03] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:59:03] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:59:04] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 620 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 284/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 12/12 constraints]
After SMT, in 50701ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 50704ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51339 ms. Remains : 285/285 places, 247/247 transitions.
Treatment of property DES-PT-40b-LTLFireability-08 finished in 326928 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&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!p1))))))'
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 394 transition count 328
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 381 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 381 transition count 317
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 368 transition count 315
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 368 transition count 315
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 366 transition count 313
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 366 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 60 place count 366 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 365 transition count 310
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 211 place count 290 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 290 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 218 place count 287 transition count 249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 285 transition count 247
Applied a total of 220 rules in 30 ms. Remains 285 /401 variables (removed 116) and now considering 247/345 (removed 98) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-21 20:59:05] [INFO ] Computed 59 invariants in 5 ms
[2024-05-21 20:59:05] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 20:59:05] [INFO ] Invariant cache hit.
[2024-05-21 20:59:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 20:59:05] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-21 20:59:05] [INFO ] Redundant transitions in 0 ms returned []
Running 243 sub problems to find dead transitions.
[2024-05-21 20:59:05] [INFO ] Invariant cache hit.
[2024-05-21 20:59:05] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 2/283 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 2/285 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 247/532 variables, 285/344 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:59:14] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-21 20:59:15] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:59:15] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 359 constraints, problems are : Problem set: 0 solved, 243 unsolved in 17892 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 2/283 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 2/285 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 247/532 variables, 285/347 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 12/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 243/602 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 20:59:44] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:59:49] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 604 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 5/5 constraints]
After SMT, in 48047ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 48049ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/401 places, 247/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48645 ms. Remains : 285/401 places, 247/345 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR p2 p1), p2, p1]
Running random walk in product with property : DES-PT-40b-LTLFireability-09
Product exploration explored 100000 steps with 4682 reset in 328 ms.
Product exploration explored 100000 steps with 4733 reset in 297 ms.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p2]
RANDOM walk for 40000 steps (1852 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (311 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1501846 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :0 out of 1
Probabilistic random walk after 1501846 steps, saw 191474 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
[2024-05-21 20:59:57] [INFO ] Invariant cache hit.
[2024-05-21 20:59:57] [INFO ] State equation strengthened by 12 read => feed constraints.
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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/187 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/226 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/235 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 244/479 variables, 235/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 53/532 variables, 50/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/532 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/187 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/226 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/235 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 244/479 variables, 235/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 53/532 variables, 50/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/532 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 446 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 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 1 place count 285 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 285 transition count 245
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 3 place count 284 transition count 245
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 5 place count 283 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 282 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 282 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 282 transition count 235
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 17 place count 281 transition count 234
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 281 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 280 transition count 233
Applied a total of 19 rules in 29 ms. Remains 280 /285 variables (removed 5) and now considering 233/247 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 280/285 places, 233/247 transitions.
RANDOM walk for 40000 steps (2040 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (365 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1529035 steps, run timeout after 3001 ms. (steps per millisecond=509 ) properties seen :0 out of 1
Probabilistic random walk after 1529035 steps, saw 206925 distinct states, run finished after 3001 ms. (steps per millisecond=509 ) properties seen :0
// Phase 1: matrix 233 rows 280 cols
[2024-05-21 21:00:02] [INFO ] Computed 60 invariants in 6 ms
[2024-05-21 21:00:02] [INFO ] State equation strengthened by 8 read => feed constraints.
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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/152 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/190 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/222 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/231 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 230/461 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 52/513 variables, 49/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/513 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:00:02] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/513 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/152 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/190 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/222 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/231 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 230/461 variables, 231/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 52/513 variables, 49/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 604ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 291 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 280/280 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-21 21:00:02] [INFO ] Invariant cache hit.
[2024-05-21 21:00:03] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 21:00:03] [INFO ] Invariant cache hit.
[2024-05-21 21:00:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 21:00:03] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2024-05-21 21:00:03] [INFO ] Redundant transitions in 0 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-21 21:00:03] [INFO ] Invariant cache hit.
[2024-05-21 21:00:03] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 233/513 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:00:16] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:00:16] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/513 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (OVERLAPS) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 350 constraints, problems are : Problem set: 0 solved, 230 unsolved in 22704 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 233/513 variables, 280/342 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 8/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 230/580 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:00:40] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:00:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:00:42] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:00:43] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 584 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 6/6 constraints]
After SMT, in 52860ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 52862ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53494 ms. Remains : 280/280 places, 233/233 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 964 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 279 /280 variables (removed 1) and now considering 233/233 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 279 cols
[2024-05-21 21:00:56] [INFO ] Computed 59 invariants in 3 ms
[2024-05-21 21:00:56] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 21:00:56] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 21:00:56] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:00:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 21:00:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 21:00:56] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:00:56] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:00:56] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 317 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 154 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 35 ms :[p2]
Stuttering acceptance computed with spot in 26 ms :[p2]
Support contains 2 out of 285 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 : 285/285 places, 247/247 transitions.
Applied a total of 0 rules in 7 ms. Remains 285 /285 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-21 21:00:57] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 21:00:57] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 21:00:57] [INFO ] Invariant cache hit.
[2024-05-21 21:00:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 21:00:57] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-21 21:00:57] [INFO ] Redundant transitions in 1 ms returned []
Running 243 sub problems to find dead transitions.
[2024-05-21 21:00:57] [INFO ] Invariant cache hit.
[2024-05-21 21:00:57] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 2/283 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 2/285 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 247/532 variables, 285/344 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 21:01:06] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:01:07] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-21 21:01:07] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 359 constraints, problems are : Problem set: 0 solved, 243 unsolved in 17811 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 2/283 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 2/285 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 247/532 variables, 285/347 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 12/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 243/602 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 21:01:35] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:01:40] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 604 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 5/5 constraints]
After SMT, in 47960ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 47962ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48552 ms. Remains : 285/285 places, 247/247 transitions.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 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 33 ms :[p2]
RANDOM walk for 40000 steps (1852 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (317 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1552053 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :0 out of 1
Probabilistic random walk after 1552053 steps, saw 197962 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
[2024-05-21 21:01:48] [INFO ] Invariant cache hit.
[2024-05-21 21:01:48] [INFO ] State equation strengthened by 12 read => feed constraints.
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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/187 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/226 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/235 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 244/479 variables, 235/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 53/532 variables, 50/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/532 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/187 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/226 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/235 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 244/479 variables, 235/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 53/532 variables, 50/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/532 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 422 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 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 1 place count 285 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 285 transition count 245
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 3 place count 284 transition count 245
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 5 place count 283 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 282 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 282 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 282 transition count 235
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 17 place count 281 transition count 234
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 281 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 280 transition count 233
Applied a total of 19 rules in 16 ms. Remains 280 /285 variables (removed 5) and now considering 233/247 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 280/285 places, 233/247 transitions.
RANDOM walk for 40000 steps (1983 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (354 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1589023 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :0 out of 1
Probabilistic random walk after 1589023 steps, saw 214086 distinct states, run finished after 3001 ms. (steps per millisecond=529 ) properties seen :0
// Phase 1: matrix 233 rows 280 cols
[2024-05-21 21:01:52] [INFO ] Computed 60 invariants in 6 ms
[2024-05-21 21:01:52] [INFO ] State equation strengthened by 8 read => feed constraints.
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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/152 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/190 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/222 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/231 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 230/461 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 52/513 variables, 49/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/513 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:01:53] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/513 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/152 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/190 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/222 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/231 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 230/461 variables, 231/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 52/513 variables, 49/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 283 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 280/280 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-21 21:01:53] [INFO ] Invariant cache hit.
[2024-05-21 21:01:54] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-21 21:01:54] [INFO ] Invariant cache hit.
[2024-05-21 21:01:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 21:01:54] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-21 21:01:54] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-21 21:01:54] [INFO ] Invariant cache hit.
[2024-05-21 21:01:54] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 233/513 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:02:06] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:02:07] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/513 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (OVERLAPS) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 350 constraints, problems are : Problem set: 0 solved, 230 unsolved in 21981 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 233/513 variables, 280/342 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 8/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 230/580 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:02:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:02:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:02:32] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:02:33] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 584 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 6/6 constraints]
After SMT, in 52110ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 52112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52683 ms. Remains : 280/280 places, 233/233 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 964 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 279 /280 variables (removed 1) and now considering 233/233 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 279 cols
[2024-05-21 21:02:46] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 21:02:46] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 21:02:46] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 21:02:46] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:02:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-21 21:02:46] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 21:02:46] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:02:46] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:02:46] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 318 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 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 :[p2]
Stuttering acceptance computed with spot in 27 ms :[p2]
Stuttering acceptance computed with spot in 31 ms :[p2]
Product exploration explored 100000 steps with 4663 reset in 243 ms.
Product exploration explored 100000 steps with 4685 reset in 264 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 247/247 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 285 transition count 246
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 284 transition count 246
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 4 place count 283 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 282 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 282 transition count 244
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 14 place count 282 transition count 236
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 16 place count 281 transition count 235
Applied a total of 16 rules in 15 ms. Remains 281 /285 variables (removed 4) and now considering 235/247 (removed 12) transitions.
// Phase 1: matrix 235 rows 281 cols
[2024-05-21 21:02:47] [INFO ] Computed 59 invariants in 4 ms
[2024-05-21 21:02:47] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 21:02:47] [INFO ] Invariant cache hit.
[2024-05-21 21:02:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 21:02:48] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-21 21:02:48] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-21 21:02:48] [INFO ] Invariant cache hit.
[2024-05-21 21:02:48] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 2/281 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 235/516 variables, 281/340 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 0/516 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 348 constraints, problems are : Problem set: 0 solved, 232 unsolved in 13401 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 2/281 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 235/516 variables, 281/340 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 232/580 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 21:03:19] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:03:20] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:03:23] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:03:27] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 584 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 4/4 constraints]
After SMT, in 43550ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 43552ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/285 places, 235/247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44080 ms. Remains : 281/285 places, 235/247 transitions.
Treatment of property DES-PT-40b-LTLFireability-09 finished in 266393 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((X(X(F(p1)))||p0))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 382 transition count 316
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 369 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 365 transition count 312
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 365 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 59 place count 365 transition count 311
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 61 place count 364 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 362 transition count 309
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 362 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 68 place count 362 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 361 transition count 306
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 219 place count 286 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 284 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 227 place count 284 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 282 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 281 transition count 230
Applied a total of 230 rules in 47 ms. Remains 281 /401 variables (removed 120) and now considering 230/345 (removed 115) transitions.
// Phase 1: matrix 230 rows 281 cols
[2024-05-21 21:03:31] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 21:03:31] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 21:03:31] [INFO ] Invariant cache hit.
[2024-05-21 21:03:32] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-05-21 21:03:32] [INFO ] Redundant transitions in 0 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-21 21:03:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/279 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/280 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 230/510 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 21:03:39] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:03:39] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:03:39] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:03:40] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 1/511 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 21:03:43] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:03:44] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:03:44] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (OVERLAPS) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 346 constraints, problems are : Problem set: 0 solved, 226 unsolved in 18502 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/279 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 1/280 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 230/510 variables, 280/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 226/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
SMT process timed out in 48626ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 48628ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/401 places, 230/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49165 ms. Remains : 281/401 places, 230/345 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-10
Product exploration explored 100000 steps with 4599 reset in 225 ms.
Product exploration explored 100000 steps with 4551 reset in 243 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 142 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1845 resets) in 564 ms. (70 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (347 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (323 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
[2024-05-21 21:04:21] [INFO ] Invariant cache hit.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/76 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/222 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/224 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/230 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 186/416 variables, 230/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/428 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 43/471 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/471 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 40/511 variables, 40/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/511 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 339 constraints, problems are : Problem set: 0 solved, 2 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/76 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/222 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/224 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/230 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 186/416 variables, 230/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/428 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 43/471 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/471 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 40/511 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 341 constraints, problems are : Problem set: 0 solved, 2 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 488 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 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 1 place count 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 17 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 279/281 places, 227/230 transitions.
RANDOM walk for 40000 steps (1811 resets) in 586 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (340 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (341 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1010283 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :0 out of 2
Probabilistic random walk after 1010283 steps, saw 127708 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
// Phase 1: matrix 227 rows 279 cols
[2024-05-21 21:04:26] [INFO ] Computed 59 invariants in 5 ms
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/75 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/221 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/227 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/229 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 183/412 variables, 229/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/424 variables, 7/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 43/467 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/467 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/467 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 39/506 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/506 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/506 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 338 constraints, problems are : Problem set: 0 solved, 2 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/75 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/221 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:04:26] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/227 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/229 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 183/412 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/424 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 43/467 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/467 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 39/506 variables, 39/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/506 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/506 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 341 constraints, problems are : Problem set: 0 solved, 2 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 704ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 533 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-21 21:04:27] [INFO ] Invariant cache hit.
[2024-05-21 21:04:27] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 21:04:27] [INFO ] Invariant cache hit.
[2024-05-21 21:04:28] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-05-21 21:04:28] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-21 21:04:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 2/277 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/278 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 227/505 variables, 278/337 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:04:34] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:04:34] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:04:34] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:04:35] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:04:37] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:04:37] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (OVERLAPS) 1/506 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (OVERLAPS) 0/506 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 344 constraints, problems are : Problem set: 0 solved, 223 unsolved in 17422 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 27/49 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/278 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 227/505 variables, 278/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 223/566 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:05:11] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/505 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 567 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 7/7 constraints]
After SMT, in 47548ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 47550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47984 ms. Remains : 279/279 places, 227/227 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 227
Applied a total of 1 rules in 12 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 279 cols
[2024-05-21 21:05:15] [INFO ] Computed 59 invariants in 3 ms
[2024-05-21 21:05:15] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:05:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 21:05:15] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-21 21:05:15] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:05:16] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:05:16] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 463 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2024-05-21 21:05:16] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 21:05:16] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 21:05:16] [INFO ] Invariant cache hit.
[2024-05-21 21:05:16] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-05-21 21:05:16] [INFO ] Redundant transitions in 0 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-21 21:05:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/279 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/280 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 230/510 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 21:05:24] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:05:24] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:05:24] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:05:24] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 1/511 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 21:05:27] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:05:28] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:05:29] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (OVERLAPS) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 346 constraints, problems are : Problem set: 0 solved, 226 unsolved in 17721 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/279 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 1/280 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 230/510 variables, 280/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 226/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
SMT process timed out in 47847ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 47849ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48322 ms. Remains : 281/281 places, 230/230 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1853 resets) in 651 ms. (61 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (346 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (328 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
[2024-05-21 21:06:05] [INFO ] Invariant cache hit.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/76 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/222 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/224 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/230 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 186/416 variables, 230/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/428 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 43/471 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/471 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 40/511 variables, 40/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/511 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 339 constraints, problems are : Problem set: 0 solved, 2 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/76 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/222 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/224 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/230 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 186/416 variables, 230/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/428 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 43/471 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/471 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 40/511 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 341 constraints, problems are : Problem set: 0 solved, 2 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 696ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 447 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 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 1 place count 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 15 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 279/281 places, 227/230 transitions.
RANDOM walk for 40000 steps (1799 resets) in 498 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (327 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (334 resets) in 259 ms. (153 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1034505 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 2
Probabilistic random walk after 1034505 steps, saw 130465 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
// Phase 1: matrix 227 rows 279 cols
[2024-05-21 21:06:09] [INFO ] Computed 59 invariants in 6 ms
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/75 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/221 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/227 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/229 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 183/412 variables, 229/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/424 variables, 7/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 43/467 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/467 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/467 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 39/506 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/506 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/506 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 338 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/75 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/221 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:06:10] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/227 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/229 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 183/412 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/424 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 43/467 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/467 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 39/506 variables, 39/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/506 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/506 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 341 constraints, problems are : Problem set: 0 solved, 2 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 788ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 441 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-21 21:06:11] [INFO ] Invariant cache hit.
[2024-05-21 21:06:11] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-21 21:06:11] [INFO ] Invariant cache hit.
[2024-05-21 21:06:11] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2024-05-21 21:06:11] [INFO ] Redundant transitions in 0 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-21 21:06:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 2/277 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/278 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 227/505 variables, 278/337 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:06:18] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-21 21:06:18] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:06:18] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:06:18] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:06:21] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:06:21] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (OVERLAPS) 1/506 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (OVERLAPS) 0/506 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 344 constraints, problems are : Problem set: 0 solved, 223 unsolved in 17370 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 27/49 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/278 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 227/505 variables, 278/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 223/566 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:06:54] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/505 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 567 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 7/7 constraints]
After SMT, in 47495ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 47497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48145 ms. Remains : 279/279 places, 227/227 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 227
Applied a total of 1 rules in 8 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 279 cols
[2024-05-21 21:06:59] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 21:06:59] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:06:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 21:06:59] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-21 21:06:59] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:06:59] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:06:59] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 383 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4588 reset in 205 ms.
Product exploration explored 100000 steps with 4652 reset in 223 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2024-05-21 21:07:00] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 21:07:00] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 21:07:00] [INFO ] Invariant cache hit.
[2024-05-21 21:07:00] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-21 21:07:01] [INFO ] Redundant transitions in 1 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-21 21:07:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/279 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/280 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 230/510 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 21:07:07] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:07:08] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:07:08] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2024-05-21 21:07:08] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 1/511 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 21:07:11] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:07:12] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:07:12] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (OVERLAPS) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 346 constraints, problems are : Problem set: 0 solved, 226 unsolved in 17721 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/279 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 1/280 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 230/510 variables, 280/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 226/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
SMT process timed out in 47841ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 47842ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48395 ms. Remains : 281/281 places, 230/230 transitions.
Treatment of property DES-PT-40b-LTLFireability-10 finished in 257166 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(F((p0||G(p1)))))'
Support contains 2 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 15 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-21 21:07:48] [INFO ] Computed 62 invariants in 10 ms
[2024-05-21 21:07:49] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 21:07:49] [INFO ] Invariant cache hit.
[2024-05-21 21:07:49] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 21:07:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:07:54] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:07:55] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-05-21 21:07:55] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-05-21 21:07:55] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:07:55] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:07:55] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-21 21:07:55] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-21 21:07:56] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:07:56] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:07:56] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:07:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:07:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:07:57] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:07:57] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:07:58] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:08:03] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:08:03] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:08:04] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:08:04] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-21 21:08:04] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:08:04] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:08:04] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:08:04] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:08:04] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:08:07] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:08:07] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:08:07] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:08:08] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:08:08] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:08:08] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:08:08] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:08:08] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:08:10] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:08:14] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:08:17] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:08:17] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:08:17] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:08:17] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:08:17] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:08:17] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:08:18] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:08:18] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:08:18] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:08:18] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:08:18] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:08:18] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:08:22] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:08:22] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:08:22] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:08:22] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:08:22] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:08:23] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:08:23] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:08:23] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:08:23] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:08:25] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:08:25] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:08:25] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:08:26] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:08:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:08:29] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:08:31] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:08:31] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:08:32] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60803 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLFireability-11 finished in 61201 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(X(G(p0))))'
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 21 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
[2024-05-21 21:08:50] [INFO ] Invariant cache hit.
[2024-05-21 21:08:50] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 21:08:50] [INFO ] Invariant cache hit.
[2024-05-21 21:08:50] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 21:08:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:08:55] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:08:56] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-21 21:08:56] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 3 ms to minimize.
[2024-05-21 21:08:56] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:08:56] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:08:56] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:08:56] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-21 21:08:57] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-21 21:08:57] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:08:57] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:08:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:08:58] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:08:58] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:08:58] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:09:00] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:09:04] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-21 21:09:04] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:09:05] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:09:05] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:09:05] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:09:05] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-21 21:09:05] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:09:05] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-21 21:09:05] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:09:09] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:09:09] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:09:09] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-21 21:09:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:09:09] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-21 21:09:09] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2024-05-21 21:09:09] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:09:09] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2024-05-21 21:09:12] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:09:15] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:09:20] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:09:20] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:09:20] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:09:23] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:09:23] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:09:23] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:09:23] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:09:24] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-05-21 21:09:24] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:09:24] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:09:24] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:09:25] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:09:26] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:09:26] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:09:27] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:09:27] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:09:27] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:09:30] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:09:32] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:09:33] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:09:33] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60833 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-12 finished in 60962 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(p2)&&p1)))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 394 transition count 328
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 381 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 381 transition count 317
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 367 transition count 314
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 367 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 367 transition count 313
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 57 place count 366 transition count 313
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 364 transition count 311
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 364 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 364 transition count 307
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 362 transition count 306
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 218 place count 287 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 222 place count 285 transition count 236
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 283 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 282 transition count 234
Applied a total of 225 rules in 32 ms. Remains 282 /401 variables (removed 119) and now considering 234/345 (removed 111) transitions.
// Phase 1: matrix 234 rows 282 cols
[2024-05-21 21:09:51] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 21:09:51] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 21:09:51] [INFO ] Invariant cache hit.
[2024-05-21 21:09:51] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-21 21:09:51] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-21 21:09:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 2/281 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 234/515 variables, 281/339 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:09:59] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:10:00] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:10:02] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:10:02] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:10:02] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:10:03] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:10:06] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:10:07] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 13 (OVERLAPS) 1/516 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:10:13] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:10:13] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:10:13] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-21 21:10:13] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 21:10:16] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 353 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 1/279 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 2/281 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (OVERLAPS) 234/515 variables, 281/352 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 230/582 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 230 unsolved
SMT process timed out in 60126ms, After SMT, problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/401 places, 234/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60618 ms. Remains : 282/401 places, 234/345 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-40b-LTLFireability-14
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-14 finished in 60751 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(F(((F((!p0&&X(F(p1))))&&G(!p2))||G((F(p1)&&F(!p0)))))))'
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 17 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-21 21:10:51] [INFO ] Computed 62 invariants in 8 ms
[2024-05-21 21:10:52] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-21 21:10:52] [INFO ] Invariant cache hit.
[2024-05-21 21:10:52] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 21:10:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:10:57] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:10:58] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-05-21 21:10:58] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 3 ms to minimize.
[2024-05-21 21:10:58] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:10:58] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:10:58] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:10:58] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:10:59] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:10:59] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:10:59] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:10:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:11:00] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:11:00] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-05-21 21:11:00] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:11:02] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:11:06] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:11:06] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-21 21:11:07] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:11:07] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:11:07] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:11:07] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:11:07] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:11:07] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:11:07] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:11:11] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:11:11] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:11:11] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:11:11] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:11:11] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-21 21:11:11] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:11:11] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:11:11] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:11:13] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:11:17] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
(s0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60786 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Running random walk in product with property : DES-PT-40b-LTLFireability-15
Product exploration explored 100000 steps with 1793 reset in 180 ms.
Product exploration explored 100000 steps with 1677 reset in 201 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 143 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (345 resets) in 337 ms. (118 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (66 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (66 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
[2024-05-21 21:11:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/372 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/378 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/716 variables, 10/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/722 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/724 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 455 constraints, problems are : Problem set: 0 solved, 2 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/372 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/378 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:11:54] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 18/716 variables, 10/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/716 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/722 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/722 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/724 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/724 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/726 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1287ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1899 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 207 place count 285 transition count 226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 283 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 212 place count 283 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 282 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 282 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 281 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 216 place count 280 transition count 226
Applied a total of 216 rules in 27 ms. Remains 280 /393 variables (removed 113) and now considering 226/333 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 280/393 places, 226/333 transitions.
RANDOM walk for 40000 steps (1640 resets) in 513 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (326 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (348 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1025111 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :0 out of 2
Probabilistic random walk after 1025111 steps, saw 140400 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
// Phase 1: matrix 226 rows 280 cols
[2024-05-21 21:12:00] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 21:12:00] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 184/416 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/425 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/467 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/467 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 39/506 variables, 39/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/506 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/506 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 346 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:12:00] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/232 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 184/416 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/416 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/425 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 42/467 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/467 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/467 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 39/506 variables, 39/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 349 constraints, problems are : Problem set: 0 solved, 2 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 758ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1609 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 280/280 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-21 21:12:02] [INFO ] Invariant cache hit.
[2024-05-21 21:12:02] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 21:12:02] [INFO ] Invariant cache hit.
[2024-05-21 21:12:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:12:03] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-21 21:12:03] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-21 21:12:03] [INFO ] Invariant cache hit.
[2024-05-21 21:12:03] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 1/277 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 2/279 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 226/505 variables, 279/339 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (OVERLAPS) 1/506 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 21:12:17] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/506 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 21:12:25] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/506 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 18 (OVERLAPS) 0/506 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 351 constraints, problems are : Problem set: 0 solved, 222 unsolved in 29840 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/277 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 2/279 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 226/505 variables, 279/344 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 6/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 222/572 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 21:12:43] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:12:44] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:12:53] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:12:55] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 576 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 9/9 constraints]
After SMT, in 59977ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 59979ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60459 ms. Remains : 280/280 places, 226/226 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 226
Applied a total of 1 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 226 rows 280 cols
[2024-05-21 21:13:03] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 21:13:03] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:13:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 21:13:03] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:13:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:13:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-21 21:13:03] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:13:03] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:13:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
TRAPS : Iteration 1
[2024-05-21 21:13:03] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:13:03] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 477 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 353 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 8 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-21 21:13:04] [INFO ] Computed 62 invariants in 8 ms
[2024-05-21 21:13:04] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 21:13:04] [INFO ] Invariant cache hit.
[2024-05-21 21:13:05] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 21:13:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:13:10] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:13:10] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-21 21:13:10] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 3 ms to minimize.
[2024-05-21 21:13:10] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-21 21:13:11] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 21:13:11] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-21 21:13:11] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:13:11] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:13:11] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:13:12] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:13:12] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:13:12] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:13:12] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:13:13] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:13:29] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:13:40] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:13:40] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:13:44] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-21 21:13:46] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:13:47] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:13:47] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in LTL mode , in 1 iterations and 60758 ms. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 161 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (343 resets) in 691 ms. (57 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (60 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (65 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
[2024-05-21 21:14:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/372 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/378 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/716 variables, 10/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/722 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/724 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 455 constraints, problems are : Problem set: 0 solved, 2 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/372 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/378 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:14:06] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 18/716 variables, 10/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/716 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/722 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/722 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/724 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/724 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/726 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1252ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1964 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 207 place count 285 transition count 226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 283 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 212 place count 283 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 282 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 282 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 281 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 216 place count 280 transition count 226
Applied a total of 216 rules in 25 ms. Remains 280 /393 variables (removed 113) and now considering 226/333 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 280/393 places, 226/333 transitions.
RANDOM walk for 40000 steps (1679 resets) in 550 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (333 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (290 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1046079 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 2
Probabilistic random walk after 1046079 steps, saw 142872 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
// Phase 1: matrix 226 rows 280 cols
[2024-05-21 21:14:12] [INFO ] Computed 60 invariants in 5 ms
[2024-05-21 21:14:12] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 184/416 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/425 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/467 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/467 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 39/506 variables, 39/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/506 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/506 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 346 constraints, problems are : Problem set: 0 solved, 2 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:14:13] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/232 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 184/416 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/416 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/425 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 42/467 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/467 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/467 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 39/506 variables, 39/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 349 constraints, problems are : Problem set: 0 solved, 2 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 747ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1387 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 280/280 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-21 21:14:14] [INFO ] Invariant cache hit.
[2024-05-21 21:14:14] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-21 21:14:14] [INFO ] Invariant cache hit.
[2024-05-21 21:14:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:14:15] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-05-21 21:14:15] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-21 21:14:15] [INFO ] Invariant cache hit.
[2024-05-21 21:14:15] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 1/277 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 2/279 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 226/505 variables, 279/339 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 21:14:22] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-21 21:14:23] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (OVERLAPS) 1/506 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 21:14:28] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 21:14:32] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/506 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 21:14:36] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/506 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 18 (OVERLAPS) 0/506 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 351 constraints, problems are : Problem set: 0 solved, 222 unsolved in 28725 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/277 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 2/279 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 226/505 variables, 279/344 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 6/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 222/572 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 21:14:54] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:14:55] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:15:03] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-21 21:15:06] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 576 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 9/9 constraints]
After SMT, in 58850ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 58852ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59297 ms. Remains : 280/280 places, 226/226 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 226
Applied a total of 1 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 226 rows 280 cols
[2024-05-21 21:15:14] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 21:15:14] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:15:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 21:15:14] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:15:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:15:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-21 21:15:14] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:15:14] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:15:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 1
[2024-05-21 21:15:14] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:15:14] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 495 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 298 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Product exploration explored 100000 steps with 1687 reset in 178 ms.
Product exploration explored 100000 steps with 1722 reset in 218 ms.
Applying partial POR strategy [false, false, true, false, true, false]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 387 transition count 330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 15 place count 387 transition count 332
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 387 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 382 transition count 327
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 382 transition count 327
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 92 places in 1 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 108 place count 382 transition count 330
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 118 place count 372 transition count 320
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 128 place count 372 transition count 320
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 372 transition count 348
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 370 transition count 342
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 370 transition count 342
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 138 rules in 73 ms. Remains 370 /393 variables (removed 23) and now considering 342/333 (removed -9) transitions.
[2024-05-21 21:15:16] [INFO ] Redundant transitions in 2 ms returned []
Running 341 sub problems to find dead transitions.
// Phase 1: matrix 342 rows 370 cols
[2024-05-21 21:15:16] [INFO ] Computed 59 invariants in 5 ms
[2024-05-21 21:15:16] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 1/370 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 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 TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 5 (OVERLAPS) 342/712 variables, 370/429 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 16/445 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 0/445 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 0/712 variables, 0/445 constraints. Problems are: Problem set: 111 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 712/712 variables, and 445 constraints, problems are : Problem set: 111 solved, 230 unsolved in 14861 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 370/370 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 111 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 13/13 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 66/349 variables, 32/45 constraints. Problems are: Problem set: 111 solved, 230 unsolved
[2024-05-21 21:15:33] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 1/46 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/46 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 14/363 variables, 14/60 constraints. Problems are: Problem set: 111 solved, 230 unsolved
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2024-05-21 21:15:36] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/65 constraints. Problems are: Problem set: 111 solved, 230 unsolved
[2024-05-21 21:15:37] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-05-21 21:15:38] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:15:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:15:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:15:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:15:38] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 6/71 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/71 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 338/701 variables, 363/434 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/701 variables, 16/450 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/701 variables, 230/680 constraints. Problems are: Problem set: 111 solved, 230 unsolved
[2024-05-21 21:15:50] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:15:50] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:15:50] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-21 21:15:50] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:15:50] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:15:51] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/712 variables, and 686 constraints, problems are : Problem set: 111 solved, 230 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 363/370 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 230/341 constraints, Known Traps: 18/18 constraints]
After SMT, in 45024ms problems are : Problem set: 111 solved, 230 unsolved
Search for dead transitions found 111 dead transitions in 45030ms
Found 111 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 111 transitions
Dead transitions reduction (with SMT) removed 111 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 370/393 places, 231/333 transitions.
Graph (complete) has 940 edges and 370 vertex of which 284 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.0 ms
Discarding 86 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 284 /370 variables (removed 86) and now considering 231/231 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 284/393 places, 231/333 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45133 ms. Remains : 284/393 places, 231/333 transitions.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 14 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-21 21:16:01] [INFO ] Computed 62 invariants in 9 ms
[2024-05-21 21:16:01] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 21:16:01] [INFO ] Invariant cache hit.
[2024-05-21 21:16:02] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 21:16:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:16:07] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:16:07] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 3 ms to minimize.
[2024-05-21 21:16:07] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-05-21 21:16:07] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:16:08] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:16:08] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:16:08] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:16:08] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:16:08] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-21 21:16:09] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:16:09] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:16:09] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:16:09] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:16:10] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:16:11] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:16:15] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:16:16] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:16:16] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:16:16] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:16:16] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:16:16] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-21 21:16:16] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:16:16] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:16:16] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:16:20] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-21 21:16:20] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:16:20] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:16:20] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:16:20] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:16:20] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-21 21:16:21] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:16:21] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:16:23] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:16:27] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:16:30] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:16:30] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:16:30] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:16:30] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:16:30] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:16:30] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:16:30] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:16:30] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:16:30] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:16:31] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:16:31] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:16:31] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:16:34] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:16:34] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:16:35] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:16:35] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:16:35] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:16:35] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:16:35] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:16:35] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:16:36] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:16:37] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:16:37] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:16:38] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:16:38] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:16:38] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:16:41] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-21 21:16:43] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 21:16:44] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:16:44] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Finished structural reductions in LTL mode , in 1 iterations and 60774 ms. Remains : 393/393 places, 333/333 transitions.
Treatment of property DES-PT-40b-LTLFireability-15 finished in 370433 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 U p1)||G(p2))))'
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) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(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' '!(G((F(G((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
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' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(p2)&&F(p3)&&(!p0 U (p1||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&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!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((X(X(F(p1)))||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(F(((F((!p0&&X(F(p1))))&&G(!p2))||G((F(p1)&&F(!p0)))))))'
Found a Shortening insensitive property : DES-PT-40b-LTLFireability-15
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 382 transition count 317
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 366 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 366 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 57 place count 366 transition count 312
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 59 place count 365 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 362 transition count 309
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 362 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 70 place count 362 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 360 transition count 303
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 221 place count 286 transition count 229
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 284 transition count 231
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 282 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 281 transition count 229
Applied a total of 228 rules in 47 ms. Remains 281 /401 variables (removed 120) and now considering 229/345 (removed 116) transitions.
// Phase 1: matrix 229 rows 281 cols
[2024-05-21 21:17:03] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 21:17:03] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 21:17:03] [INFO ] Invariant cache hit.
[2024-05-21 21:17:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:17:03] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-21 21:17:03] [INFO ] Invariant cache hit.
[2024-05-21 21:17:03] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 229/509 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:17:11] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 1/510 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:17:17] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 225 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 229/509 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 225/571 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:17:39] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:17:40] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:17:40] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/510 variables, and 574 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 280/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 5/5 constraints]
After SMT, in 50177ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 50179ms
Starting structural reductions in LI_LTL mode, iteration 1 : 281/401 places, 229/345 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 50692 ms. Remains : 281/401 places, 229/345 transitions.
Running random walk in product with property : DES-PT-40b-LTLFireability-15
Product exploration explored 100000 steps with 8166 reset in 215 ms.
Product exploration explored 100000 steps with 8174 reset in 245 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 182 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1833 resets) in 623 ms. (64 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (382 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (368 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
[2024-05-21 21:17:55] [INFO ] Invariant cache hit.
[2024-05-21 21:17:55] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/197 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/227 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 187/419 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/428 variables, 7/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/470 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/470 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/470 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/510 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/197 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/227 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 187/419 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/428 variables, 7/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 42/470 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/470 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/470 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 40/510 variables, 40/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 2 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 776ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2967 ms.
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 229/229 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 1 place count 281 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Applied a total of 4 rules in 16 ms. Remains 280 /281 variables (removed 1) and now considering 227/229 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 280/281 places, 227/229 transitions.
RANDOM walk for 40000 steps (1820 resets) in 609 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (373 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (369 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 946100 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :0 out of 2
Probabilistic random walk after 946100 steps, saw 130667 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
// Phase 1: matrix 227 rows 280 cols
[2024-05-21 21:18:02] [INFO ] Computed 59 invariants in 8 ms
[2024-05-21 21:18:02] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 185/417 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/426 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/468 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/468 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/468 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 39/507 variables, 39/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/507 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:18:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/232 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 185/417 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/426 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 42/468 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/468 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/468 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 39/507 variables, 39/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 348 constraints, problems are : Problem set: 0 solved, 2 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 765ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 905 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 280/280 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-21 21:18:03] [INFO ] Invariant cache hit.
[2024-05-21 21:18:04] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 21:18:04] [INFO ] Invariant cache hit.
[2024-05-21 21:18:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:18:04] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-05-21 21:18:04] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-21 21:18:04] [INFO ] Invariant cache hit.
[2024-05-21 21:18:04] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 1/277 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 2/279 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 227/506 variables, 279/338 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:18:12] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:18:15] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:18:18] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (OVERLAPS) 1/507 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (OVERLAPS) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 348 constraints, problems are : Problem set: 0 solved, 223 unsolved in 22873 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 1/277 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 2/279 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 227/506 variables, 279/341 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 223/570 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:18:37] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:18:43] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:18:46] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:18:47] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:18:48] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 5/575 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 506/507 variables, and 575 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 8/8 constraints]
After SMT, in 53005ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 53007ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53526 ms. Remains : 280/280 places, 227/227 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 227
Applied a total of 1 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 280 cols
[2024-05-21 21:18:57] [INFO ] Computed 59 invariants in 6 ms
[2024-05-21 21:18:57] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 21:18:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 21:18:57] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:18:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 21:18:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-21 21:18:57] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:18:57] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:18:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
TRAPS : Iteration 1
[2024-05-21 21:18:57] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:18:57] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 429 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 303 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 229/229 transitions.
Applied a total of 0 rules in 3 ms. Remains 281 /281 variables (removed 0) and now considering 229/229 (removed 0) transitions.
// Phase 1: matrix 229 rows 281 cols
[2024-05-21 21:18:58] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 21:18:58] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 21:18:58] [INFO ] Invariant cache hit.
[2024-05-21 21:18:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:18:59] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-21 21:18:59] [INFO ] Invariant cache hit.
[2024-05-21 21:18:59] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 229/509 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:19:06] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 1/510 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:19:13] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 225 unsolved in 19788 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 229/509 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 225/571 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:19:34] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:19:34] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-21 21:19:34] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/510 variables, and 574 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 280/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 5/5 constraints]
After SMT, in 49931ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 49934ms
Finished structural reductions in LTL mode , in 1 iterations and 50409 ms. Remains : 281/281 places, 229/229 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 150 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1856 resets) in 757 ms. (52 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (358 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (374 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
[2024-05-21 21:19:49] [INFO ] Invariant cache hit.
[2024-05-21 21:19:49] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/197 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/227 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 187/419 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/428 variables, 7/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/470 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/470 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/470 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/510 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/197 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/227 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 187/419 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/428 variables, 7/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 42/470 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/470 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/470 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 40/510 variables, 40/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 2 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 712ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2966 ms.
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 229/229 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 1 place count 281 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Applied a total of 4 rules in 19 ms. Remains 280 /281 variables (removed 1) and now considering 227/229 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 280/281 places, 227/229 transitions.
RANDOM walk for 40000 steps (1788 resets) in 695 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (362 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (359 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 986145 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :0 out of 2
Probabilistic random walk after 986145 steps, saw 135678 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
// Phase 1: matrix 227 rows 280 cols
[2024-05-21 21:19:56] [INFO ] Computed 59 invariants in 6 ms
[2024-05-21 21:19:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 185/417 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/426 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/468 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/468 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/468 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 39/507 variables, 39/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/507 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:19:57] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/232 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 185/417 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/426 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 42/468 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/468 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/468 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 39/507 variables, 39/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 348 constraints, problems are : Problem set: 0 solved, 2 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 768ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 858 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 280/280 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-21 21:19:58] [INFO ] Invariant cache hit.
[2024-05-21 21:19:58] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 21:19:58] [INFO ] Invariant cache hit.
[2024-05-21 21:19:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:19:58] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-21 21:19:58] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-21 21:19:58] [INFO ] Invariant cache hit.
[2024-05-21 21:19:58] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 1/277 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 2/279 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 227/506 variables, 279/338 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:20:06] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:20:09] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:20:12] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (OVERLAPS) 1/507 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (OVERLAPS) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 348 constraints, problems are : Problem set: 0 solved, 223 unsolved in 22031 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 1/277 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 2/279 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 227/506 variables, 279/341 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 223/570 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 21:20:30] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:20:36] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:20:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:20:41] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:20:42] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 5/575 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 506/507 variables, and 575 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 8/8 constraints]
After SMT, in 52156ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 52160ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52692 ms. Remains : 280/280 places, 227/227 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 227
Applied a total of 1 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 280 cols
[2024-05-21 21:20:51] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 21:20:51] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-21 21:20:51] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-21 21:20:51] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:20:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 21:20:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-21 21:20:51] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:20:51] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:20:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
TRAPS : Iteration 1
[2024-05-21 21:20:51] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:20:51] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 520 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 297 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Product exploration explored 100000 steps with 8241 reset in 232 ms.
Product exploration explored 100000 steps with 8002 reset in 251 ms.
Applying partial POR strategy [false, false, true, false, true, false]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 229/229 transitions.
Applied a total of 0 rules in 8 ms. Remains 281 /281 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-21 21:20:53] [INFO ] Redundant transitions in 1 ms returned []
Running 225 sub problems to find dead transitions.
// Phase 1: matrix 229 rows 281 cols
[2024-05-21 21:20:53] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 21:20:53] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 229/509 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 1/510 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:21:03] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:21:09] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/510 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 15 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 225 unsolved in 22725 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 229/509 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 225/571 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:21:26] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:21:28] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:21:32] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:21:32] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:21:33] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:21:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:21:36] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:21:38] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 8/579 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/510 variables, and 579 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 280/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 10/10 constraints]
After SMT, in 52862ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 52864ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52878 ms. Remains : 281/281 places, 229/229 transitions.
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 229/229 transitions.
Applied a total of 0 rules in 2 ms. Remains 281 /281 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-21 21:21:46] [INFO ] Invariant cache hit.
[2024-05-21 21:21:46] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 21:21:46] [INFO ] Invariant cache hit.
[2024-05-21 21:21:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 21:21:46] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-21 21:21:46] [INFO ] Invariant cache hit.
[2024-05-21 21:21:46] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 229/509 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:21:55] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 1/510 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:22:01] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 225 unsolved in 20487 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 229/509 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 225/571 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 21:22:23] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:22:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/510 variables, and 574 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 280/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 5/5 constraints]
After SMT, in 50645ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 50648ms
Finished structural reductions in LTL mode , in 1 iterations and 51124 ms. Remains : 281/281 places, 229/229 transitions.
Treatment of property DES-PT-40b-LTLFireability-15 finished in 334641 ms.
[2024-05-21 21:22:37] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:22:37] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-21 21:22:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 401 places, 345 transitions and 1187 arcs took 3 ms.
Total runtime 2845285 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-40b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 401
TRANSITIONS: 345
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.001s]


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 6421
MODEL NAME: /home/mcc/execution/415/model
401 places, 345 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-40b-LTLFireability-01 CANNOT_COMPUTE
FORMULA DES-PT-40b-LTLFireability-05 CANNOT_COMPUTE
FORMULA DES-PT-40b-LTLFireability-06 CANNOT_COMPUTE
FORMULA DES-PT-40b-LTLFireability-08 CANNOT_COMPUTE
FORMULA DES-PT-40b-LTLFireability-09 CANNOT_COMPUTE
FORMULA DES-PT-40b-LTLFireability-10 CANNOT_COMPUTE
FORMULA DES-PT-40b-LTLFireability-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716327100203

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DES-PT-40b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188300724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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