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.r528-tall-171683760300092.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 ltsminxred
Input is ShieldIIPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760300092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 164K May 18 16:43 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 ShieldIIPs-PT-010B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225353077

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:02:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:02:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:02:34] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-01 07:02:34] [INFO ] Transformed 603 places.
[2024-06-01 07:02:34] [INFO ] Transformed 593 transitions.
[2024-06-01 07:02:34] [INFO ] Found NUPN structural information;
[2024-06-01 07:02:34] [INFO ] Parsed PT model containing 603 places and 593 transitions and 1786 arcs in 228 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 4 formulas.
FORMULA ShieldIIPs-PT-010B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 593/593 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 536 transition count 526
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 536 transition count 526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 135 place count 535 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 136 place count 535 transition count 525
Applied a total of 136 rules in 110 ms. Remains 535 /603 variables (removed 68) and now considering 525/593 (removed 68) transitions.
// Phase 1: matrix 525 rows 535 cols
[2024-06-01 07:02:34] [INFO ] Computed 91 invariants in 30 ms
[2024-06-01 07:02:35] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-01 07:02:35] [INFO ] Invariant cache hit.
[2024-06-01 07:02:35] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-06-01 07:02:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/535 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 13 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 4 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 4 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 7 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 4 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-01 07:03:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/1060 variables, and 191 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/535 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/535 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 100/191 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:03:14] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-01 07:03:16] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:03:16] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:16] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:03:16] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:03:17] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:17] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:03:17] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:03:17] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:03:17] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:22] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 4 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 31 places in 25 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 535/1060 variables, and 290 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/535 constraints, PredecessorRefiner: 0/524 constraints, Known Traps: 199/199 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 535/603 places, 525/593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61191 ms. Remains : 535/603 places, 525/593 transitions.
Support contains 43 out of 535 places after structural reductions.
[2024-06-01 07:03:36] [INFO ] Flatten gal took : 71 ms
[2024-06-01 07:03:36] [INFO ] Flatten gal took : 33 ms
[2024-06-01 07:03:36] [INFO ] Input system was already deterministic with 525 transitions.
Support contains 41 out of 535 places (down from 43) after GAL structural reductions.
RANDOM walk for 34686 steps (24 resets) in 1372 ms. (25 steps per ms) remains 0/25 properties
FORMULA ShieldIIPs-PT-010B-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 120 stabilizing places and 120 stable transitions
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(G(p1))))'
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 31 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-06-01 07:03:37] [INFO ] Computed 91 invariants in 8 ms
[2024-06-01 07:03:37] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 07:03:37] [INFO ] Invariant cache hit.
[2024-06-01 07:03:37] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-06-01 07:03:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:03:45] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:45] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:45] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:46] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:03:46] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:03:46] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:03:46] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:03:46] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:03:47] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:03:48] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:49] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
SMT process timed out in 30143ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30150ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30730 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-00 finished in 31134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 31 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
[2024-06-01 07:04:08] [INFO ] Invariant cache hit.
[2024-06-01 07:04:08] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 07:04:08] [INFO ] Invariant cache hit.
[2024-06-01 07:04:08] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-06-01 07:04:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:04:19] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:04:38] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
SMT process timed out in 30108ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30114ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30692 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/532 stabilizing places and 119/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-02 finished in 31313 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))'
Support contains 1 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 534 transition count 473
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 483 transition count 473
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 483 transition count 422
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 432 transition count 422
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 207 place count 429 transition count 419
Iterating global reduction 2 with 3 rules applied. Total rules applied 210 place count 429 transition count 419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 210 place count 429 transition count 418
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 212 place count 428 transition count 418
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 0 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 560 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 563 place count 251 transition count 242
Applied a total of 563 rules in 152 ms. Remains 251 /535 variables (removed 284) and now considering 242/525 (removed 283) transitions.
// Phase 1: matrix 242 rows 251 cols
[2024-06-01 07:04:39] [INFO ] Computed 90 invariants in 2 ms
[2024-06-01 07:04:39] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 07:04:39] [INFO ] Invariant cache hit.
[2024-06-01 07:04:39] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-01 07:04:40] [INFO ] Redundant transitions in 47 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 239 sub problems to find dead transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-06-01 07:04:40] [INFO ] Computed 90 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 10 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:04:42] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:04:44] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:04:44] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:04:44] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:04:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 1/251 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:04:48] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:04:48] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:04:48] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:04:49] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:04:49] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 241/492 variables, 251/391 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 10/413 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:06] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:05:06] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:05:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/492 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:09] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:05:09] [INFO ] Deduced a trap composed of 8 places in 21 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 492/492 variables, and 423 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 80/164 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 1/251 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/423 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 239/662 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:14] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:05:29] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 4/667 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 668 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 88/88 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/535 places, 241/525 transitions.
Applied a total of 0 rules in 19 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60631 ms. Remains : 251/535 places, 241/525 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-04
Product exploration explored 100000 steps with 27233 reset in 225 ms.
Product exploration explored 100000 steps with 27199 reset in 254 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/251 stabilizing places and 2/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 07:05:41] [INFO ] Invariant cache hit.
[2024-06-01 07:05:41] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2024-06-01 07:05:41] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-06-01 07:05:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:05:41] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2024-06-01 07:05:41] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 128 ms
[2024-06-01 07:05:41] [INFO ] Computed and/alt/rep : 237/588/237 causal constraints (skipped 2 transitions) in 14 ms.
[2024-06-01 07:05:42] [INFO ] Added : 182 causal constraints over 37 iterations in 1162 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-06-01 07:05:42] [INFO ] Invariant cache hit.
[2024-06-01 07:05:43] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 07:05:43] [INFO ] Invariant cache hit.
[2024-06-01 07:05:43] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-01 07:05:43] [INFO ] Redundant transitions in 40 ms returned []
Running 239 sub problems to find dead transitions.
[2024-06-01 07:05:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 1/251 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 241/492 variables, 251/387 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 5/392 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 10/402 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 9/411 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 5/418 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/492 variables, 9/430 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 430 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 87/171 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 1/251 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/430 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 239/669 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 672 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 92/92 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60467 ms. Remains : 251/251 places, 241/241 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/251 stabilizing places and 2/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 22 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-06-01 07:06:43] [INFO ] Invariant cache hit.
[2024-06-01 07:06:44] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2024-06-01 07:06:44] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-06-01 07:06:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:06:44] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2024-06-01 07:06:44] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 150 ms
[2024-06-01 07:06:44] [INFO ] Computed and/alt/rep : 237/588/237 causal constraints (skipped 2 transitions) in 15 ms.
[2024-06-01 07:06:45] [INFO ] Added : 182 causal constraints over 37 iterations in 1168 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27210 reset in 233 ms.
Product exploration explored 100000 steps with 27209 reset in 262 ms.
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 6 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-06-01 07:06:46] [INFO ] Invariant cache hit.
[2024-06-01 07:06:46] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 07:06:46] [INFO ] Invariant cache hit.
[2024-06-01 07:06:46] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-01 07:06:46] [INFO ] Redundant transitions in 33 ms returned []
Running 239 sub problems to find dead transitions.
[2024-06-01 07:06:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:47] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:06:47] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 1/251 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 241/492 variables, 251/387 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 5/392 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:07:03] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:07:03] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 10/402 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:07:04] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:07:04] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:07:04] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:07:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:07:04] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:07:04] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:07:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:07:04] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:07:04] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 9/411 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 5/418 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 429 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 86/170 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 1/251 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/429 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 239/668 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 2/670 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:07:31] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 3/673 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 673 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 93/93 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60464 ms. Remains : 251/251 places, 241/241 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-04 finished in 187453 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||G(F((p1||(p2 U (p3||G(p2)))))))))'
Support contains 7 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 12 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-06-01 07:07:46] [INFO ] Computed 91 invariants in 2 ms
[2024-06-01 07:07:47] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 07:07:47] [INFO ] Invariant cache hit.
[2024-06-01 07:07:47] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-06-01 07:07:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 4 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 21 places in 58 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")
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1054 variables, and 191 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 100/191 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:08:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:39] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 18/289 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1054 variables, and 289 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 0/521 constraints, Known Traps: 198/198 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60715 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-05
Product exploration explored 100000 steps with 486 reset in 343 ms.
Product exploration explored 100000 steps with 521 reset in 406 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/532 stabilizing places and 119/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 88 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (28 resets) in 359 ms. (111 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
[2024-06-01 07:08:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 439/532 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 522/1054 variables, 532/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1054 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1054 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1054/1054 variables, and 623 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 532/532 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 93/1054 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 13/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 266ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2 p3))), (F (NOT p2)), (F (NOT p3))]
Knowledge based reduction with 13 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 6 out of 532 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 : 532/532 places, 522/522 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 531 transition count 473
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 483 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 482 transition count 472
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 98 place count 482 transition count 422
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 198 place count 432 transition count 422
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 542 place count 260 transition count 250
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 544 place count 258 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 545 place count 257 transition count 248
Applied a total of 545 rules in 83 ms. Remains 257 /532 variables (removed 275) and now considering 248/522 (removed 274) transitions.
// Phase 1: matrix 248 rows 257 cols
[2024-06-01 07:08:49] [INFO ] Computed 90 invariants in 2 ms
[2024-06-01 07:08:49] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 07:08:49] [INFO ] Invariant cache hit.
[2024-06-01 07:08:49] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-01 07:08:50] [INFO ] Redundant transitions in 36 ms returned [247]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 244 sub problems to find dead transitions.
// Phase 1: matrix 247 rows 257 cols
[2024-06-01 07:08:50] [INFO ] Computed 90 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 2/257 variables, 65/97 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 247/504 variables, 257/390 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 17/407 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 5/416 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 5/421 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 5/426 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/504 variables, and 427 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 2/257 variables, 65/113 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 57/170 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 247/504 variables, 257/429 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 244/673 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 14/687 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 687 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 96/96 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in SI_LTL mode, iteration 1 : 257/532 places, 247/522 transitions.
Applied a total of 0 rules in 7 ms. Remains 257 /257 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60516 ms. Remains : 257/532 places, 247/522 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p3)]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (NOT p1)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 464 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 77 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p3)]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (NOT p1)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR p1 p3)))]
Knowledge based reduction with 1 factoid took 360 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 74 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 1008 reset in 347 ms.
Product exploration explored 100000 steps with 947 reset in 385 ms.
Support contains 6 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 247/247 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 257 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 256 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 256 transition count 245
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 255 transition count 245
Applied a total of 4 rules in 11 ms. Remains 255 /257 variables (removed 2) and now considering 245/247 (removed 2) transitions.
// Phase 1: matrix 245 rows 255 cols
[2024-06-01 07:09:51] [INFO ] Computed 90 invariants in 2 ms
[2024-06-01 07:09:52] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 07:09:52] [INFO ] Invariant cache hit.
[2024-06-01 07:09:52] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-01 07:09:52] [INFO ] Redundant transitions in 31 ms returned []
Running 243 sub problems to find dead transitions.
[2024-06-01 07:09:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:09:53] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:09:54] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/255 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:56] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 245/500 variables, 255/387 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:10:03] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:10:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:10:03] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 8/403 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 7/410 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/500 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/500 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/500 variables, and 425 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/255 variables, 64/110 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 60/170 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 245/500 variables, 255/426 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 243/669 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 16/685 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 9/694 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 694 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 106/106 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in SI_LTL mode, iteration 1 : 255/257 places, 245/247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60429 ms. Remains : 255/257 places, 245/247 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-05 finished in 185515 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(F(p1))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 11 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-06-01 07:10:52] [INFO ] Computed 91 invariants in 6 ms
[2024-06-01 07:10:52] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 07:10:52] [INFO ] Invariant cache hit.
[2024-06-01 07:10:52] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-06-01 07:10:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 5 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 8 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1054 variables, and 131 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 40/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1054 variables, and 251 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 0/521 constraints, Known Traps: 160/160 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60611 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-06
Product exploration explored 100000 steps with 3354 reset in 199 ms.
Product exploration explored 100000 steps with 3310 reset in 205 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/532 stabilizing places and 119/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 21056 steps (15 resets) in 91 ms. (228 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 313 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 07:11:54] [INFO ] Invariant cache hit.
[2024-06-01 07:11:54] [INFO ] [Real]Absence check using 91 positive place invariants in 32 ms returned sat
[2024-06-01 07:11:55] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2024-06-01 07:11:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:11:55] [INFO ] [Nat]Absence check using 91 positive place invariants in 31 ms returned sat
[2024-06-01 07:11:56] [INFO ] [Nat]Absence check using state equation in 945 ms returned sat
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 280 ms
[2024-06-01 07:11:57] [INFO ] Computed and/alt/rep : 521/1172/521 causal constraints (skipped 0 transitions) in 31 ms.
[2024-06-01 07:12:10] [INFO ] Added : 516 causal constraints over 110 iterations in 13557 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 531 transition count 471
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 481 transition count 471
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 100 place count 481 transition count 421
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 200 place count 431 transition count 421
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 550 place count 256 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 552 place count 254 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 553 place count 253 transition count 244
Applied a total of 553 rules in 41 ms. Remains 253 /532 variables (removed 279) and now considering 244/522 (removed 278) transitions.
// Phase 1: matrix 244 rows 253 cols
[2024-06-01 07:12:10] [INFO ] Computed 90 invariants in 1 ms
[2024-06-01 07:12:10] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 07:12:10] [INFO ] Invariant cache hit.
[2024-06-01 07:12:10] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-01 07:12:10] [INFO ] Redundant transitions in 27 ms returned [243]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-06-01 07:12:10] [INFO ] Computed 90 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 2/253 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 10/137 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 243/496 variables, 253/393 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 14/409 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 6/418 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 5/428 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 434 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 91/91 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 87/171 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 2/253 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 243/496 variables, 253/436 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 241/677 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 3/680 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 681 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 97/97 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 253/532 places, 243/522 transitions.
Applied a total of 0 rules in 8 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60457 ms. Remains : 253/532 places, 243/522 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/253 stabilizing places and 2/243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-06 finished in 138614 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(F(!p0))||(F(!p0)&&X(p1)))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 10 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-06-01 07:13:11] [INFO ] Computed 91 invariants in 3 ms
[2024-06-01 07:13:11] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 07:13:11] [INFO ] Invariant cache hit.
[2024-06-01 07:13:11] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-06-01 07:13:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
SMT process timed out in 30094ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30099ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30590 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 129 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-07 finished in 31050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&G(F(p1)))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 10 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
[2024-06-01 07:13:42] [INFO ] Invariant cache hit.
[2024-06-01 07:13:42] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 07:13:42] [INFO ] Invariant cache hit.
[2024-06-01 07:13:42] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-06-01 07:13:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
SMT process timed out in 30101ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30106ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30634 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-09 finished in 30936 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(X(X((F(p0)||X(X(G(p1)))))))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 533 transition count 523
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 533 transition count 523
Applied a total of 4 rules in 15 ms. Remains 533 /535 variables (removed 2) and now considering 523/525 (removed 2) transitions.
// Phase 1: matrix 523 rows 533 cols
[2024-06-01 07:14:13] [INFO ] Computed 91 invariants in 3 ms
[2024-06-01 07:14:13] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 07:14:13] [INFO ] Invariant cache hit.
[2024-06-01 07:14:13] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-06-01 07:14:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1056 variables, and 191 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 100/191 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/1056 variables, and 291 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 200/200 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 533/535 places, 523/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60637 ms. Remains : 533/535 places, 523/525 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-10
Product exploration explored 100000 steps with 20000 reset in 107 ms.
Product exploration explored 100000 steps with 20000 reset in 111 ms.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 9106 steps (5 resets) in 56 ms. (159 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 523/523 transitions.
Applied a total of 0 rules in 9 ms. Remains 533 /533 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-06-01 07:15:15] [INFO ] Invariant cache hit.
[2024-06-01 07:15:15] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 07:15:15] [INFO ] Invariant cache hit.
[2024-06-01 07:15:15] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-06-01 07:15:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 4 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1056 variables, and 191 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 100/191 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/1056 variables, and 291 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 200/200 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in LTL mode , in 1 iterations and 60662 ms. Remains : 533/533 places, 523/523 transitions.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 13572 steps (8 resets) in 62 ms. (215 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 108 ms.
Product exploration explored 100000 steps with 20000 reset in 126 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 523/523 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 533 transition count 523
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 49 place count 533 transition count 525
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 71 place count 533 transition count 525
Performed 209 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 1 with 209 rules applied. Total rules applied 280 place count 533 transition count 525
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 351 place count 462 transition count 454
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 422 place count 462 transition count 454
Deduced a syphon composed of 209 places in 0 ms
Applied a total of 422 rules in 78 ms. Remains 462 /533 variables (removed 71) and now considering 454/523 (removed 69) transitions.
[2024-06-01 07:16:18] [INFO ] Redundant transitions in 28 ms returned [453]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 452 sub problems to find dead transitions.
// Phase 1: matrix 453 rows 462 cols
[2024-06-01 07:16:18] [INFO ] Computed 91 invariants in 2 ms
[2024-06-01 07:16:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/462 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD420 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 20/111 constraints. Problems are: Problem set: 85 solved, 367 unsolved
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 20/131 constraints. Problems are: Problem set: 142 solved, 310 unsolved
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 20/151 constraints. Problems are: Problem set: 180 solved, 272 unsolved
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Problem TDEAD140 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD211 is UNSAT
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 20/171 constraints. Problems are: Problem set: 203 solved, 249 unsolved
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD266 is UNSAT
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD320 is UNSAT
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD346 is UNSAT
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD373 is UNSAT
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD400 is UNSAT
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD426 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 10/181 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/181 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 453/915 variables, 462/643 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/915 variables, 3/646 constraints. Problems are: Problem set: 211 solved, 241 unsolved
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/915 variables, 1/647 constraints. Problems are: Problem set: 211 solved, 241 unsolved
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/915 variables, 10/657 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/915 variables, 0/657 constraints. Problems are: Problem set: 211 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 657 constraints, problems are : Problem set: 211 solved, 241 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 462/462 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 101/101 constraints]
Escalating to Integer solving :Problem set: 211 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 210/462 variables, 91/91 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 101/192 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/192 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 453/915 variables, 462/654 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 3/657 constraints. Problems are: Problem set: 211 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/915 variables, 241/898 constraints. Problems are: Problem set: 211 solved, 241 unsolved
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/915 variables, 13/911 constraints. Problems are: Problem set: 211 solved, 241 unsolved
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 912 constraints, problems are : Problem set: 211 solved, 241 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 462/462 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 241/452 constraints, Known Traps: 115/115 constraints]
After SMT, in 60111ms problems are : Problem set: 211 solved, 241 unsolved
Search for dead transitions found 211 dead transitions in 60115ms
Found 211 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 211 transitions
Dead transitions reduction (with SMT) removed 211 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 462/533 places, 242/523 transitions.
Graph (complete) has 881 edges and 462 vertex of which 253 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.2 ms
Discarding 209 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 253 /462 variables (removed 209) and now considering 242/242 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 253/533 places, 242/523 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60237 ms. Remains : 253/533 places, 242/523 transitions.
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 523/523 transitions.
Applied a total of 0 rules in 13 ms. Remains 533 /533 variables (removed 0) and now considering 523/523 (removed 0) transitions.
// Phase 1: matrix 523 rows 533 cols
[2024-06-01 07:17:18] [INFO ] Computed 91 invariants in 3 ms
[2024-06-01 07:17:18] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 07:17:18] [INFO ] Invariant cache hit.
[2024-06-01 07:17:18] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-06-01 07:17:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1056 variables, and 191 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 100/191 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/1056 variables, and 291 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 200/200 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Finished structural reductions in LTL mode , in 1 iterations and 60703 ms. Remains : 533/533 places, 523/523 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-10 finished in 246027 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&&X(!p1)&&F(!p2))||(p0&&X(G(!p1)))))))'
Support contains 7 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 532 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 532 transition count 522
Applied a total of 6 rules in 25 ms. Remains 532 /535 variables (removed 3) and now considering 522/525 (removed 3) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-06-01 07:18:19] [INFO ] Computed 91 invariants in 2 ms
[2024-06-01 07:18:19] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 07:18:19] [INFO ] Invariant cache hit.
[2024-06-01 07:18:19] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-06-01 07:18:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:18:38] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1054 variables, and 191 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 100/191 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 4 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:19:07] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 18/289 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1054 variables, and 289 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 0/521 constraints, Known Traps: 198/198 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 532/535 places, 522/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60663 ms. Remains : 532/535 places, 522/525 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-11
Product exploration explored 100000 steps with 33504 reset in 147 ms.
Product exploration explored 100000 steps with 33160 reset in 154 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 108 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
RANDOM walk for 29807 steps (20 resets) in 344 ms. (86 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 20 factoid took 322 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Applied a total of 0 rules in 9 ms. Remains 532 /532 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-06-01 07:19:21] [INFO ] Invariant cache hit.
[2024-06-01 07:19:21] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 07:19:21] [INFO ] Invariant cache hit.
[2024-06-01 07:19:22] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-06-01 07:19:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:19:41] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:19:41] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:19:41] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:19:41] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 4 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 3 ms to minimize.
SMT process timed out in 30076ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30080ms
Finished structural reductions in LTL mode , in 1 iterations and 30632 ms. Remains : 532/532 places, 522/522 transitions.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 142 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
RANDOM walk for 35733 steps (25 resets) in 1047 ms. (34 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 20 factoid took 450 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 33126 reset in 151 ms.
Product exploration explored 100000 steps with 33297 reset in 159 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 532 transition count 522
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 48 place count 532 transition count 524
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 71 place count 532 transition count 524
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 275 places in 0 ms
Iterating global reduction 1 with 204 rules applied. Total rules applied 275 place count 532 transition count 524
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 342 place count 465 transition count 457
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 409 place count 465 transition count 457
Deduced a syphon composed of 208 places in 1 ms
Applied a total of 409 rules in 46 ms. Remains 465 /532 variables (removed 67) and now considering 457/522 (removed 65) transitions.
[2024-06-01 07:19:54] [INFO ] Redundant transitions in 40 ms returned [456]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 455 sub problems to find dead transitions.
// Phase 1: matrix 456 rows 465 cols
[2024-06-01 07:19:54] [INFO ] Computed 91 invariants in 3 ms
[2024-06-01 07:19:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/465 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 20/111 constraints. Problems are: Problem set: 81 solved, 374 unsolved
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 20/131 constraints. Problems are: Problem set: 138 solved, 317 unsolved
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 20/151 constraints. Problems are: Problem set: 177 solved, 278 unsolved
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD152 is UNSAT
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 20/171 constraints. Problems are: Problem set: 202 solved, 253 unsolved
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD271 is UNSAT
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD322 is UNSAT
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD349 is UNSAT
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD376 is UNSAT
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD403 is UNSAT
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD429 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 9/180 constraints. Problems are: Problem set: 210 solved, 245 unsolved
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 4/184 constraints. Problems are: Problem set: 210 solved, 245 unsolved
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 1/185 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/185 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 10 (OVERLAPS) 456/921 variables, 465/650 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 3/653 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 0/653 constraints. Problems are: Problem set: 210 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 921/921 variables, and 653 constraints, problems are : Problem set: 210 solved, 245 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 465/465 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 210 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 209/465 variables, 91/91 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 94/185 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 0/185 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 456/921 variables, 465/650 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/921 variables, 3/653 constraints. Problems are: Problem set: 210 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 245/898 constraints. Problems are: Problem set: 210 solved, 245 unsolved
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 12/910 constraints. Problems are: Problem set: 210 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 921/921 variables, and 910 constraints, problems are : Problem set: 210 solved, 245 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 465/465 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 245/455 constraints, Known Traps: 106/106 constraints]
After SMT, in 60119ms problems are : Problem set: 210 solved, 245 unsolved
Search for dead transitions found 210 dead transitions in 60124ms
Found 210 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 210 transitions
Dead transitions reduction (with SMT) removed 210 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 465/532 places, 246/522 transitions.
Graph (complete) has 886 edges and 465 vertex of which 257 are kept as prefixes of interest. Removing 208 places using SCC suffix rule.1 ms
Discarding 208 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 257 /465 variables (removed 208) and now considering 246/246 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 257/532 places, 246/522 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60224 ms. Remains : 257/532 places, 246/522 transitions.
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Applied a total of 0 rules in 5 ms. Remains 532 /532 variables (removed 0) and now considering 522/522 (removed 0) transitions.
// Phase 1: matrix 522 rows 532 cols
[2024-06-01 07:20:55] [INFO ] Computed 91 invariants in 2 ms
[2024-06-01 07:20:55] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 07:20:55] [INFO ] Invariant cache hit.
[2024-06-01 07:20:55] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2024-06-01 07:20:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1054 variables, and 191 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 100/191 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:21:38] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:21:38] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:21:39] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:21:39] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 18/289 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1054 variables, and 289 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 0/521 constraints, Known Traps: 198/198 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Finished structural reductions in LTL mode , in 1 iterations and 60604 ms. Remains : 532/532 places, 522/522 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-11 finished in 216586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||F(p2))))))'
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 534 transition count 473
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 483 transition count 473
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 483 transition count 422
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 432 transition count 422
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 205 place count 431 transition count 421
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 431 transition count 421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 206 place count 431 transition count 420
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 208 place count 430 transition count 420
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 560 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 563 place count 251 transition count 242
Applied a total of 563 rules in 41 ms. Remains 251 /535 variables (removed 284) and now considering 242/525 (removed 283) transitions.
// Phase 1: matrix 242 rows 251 cols
[2024-06-01 07:21:55] [INFO ] Computed 90 invariants in 2 ms
[2024-06-01 07:21:55] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 07:21:55] [INFO ] Invariant cache hit.
[2024-06-01 07:21:55] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-01 07:21:56] [INFO ] Redundant transitions in 23 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 240 sub problems to find dead transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-06-01 07:21:56] [INFO ] Computed 90 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 9/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/492 variables, 251/390 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/492 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 5/408 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 7/415 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:22] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:22:22] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 425 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 84/174 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 241/492 variables, 251/425 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 240/665 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 0/492 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 665 constraints, problems are : Problem set: 0 solved, 240 unsolved in 16349 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 84/84 constraints]
After SMT, in 46389ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 46391ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/535 places, 241/525 transitions.
Applied a total of 0 rules in 4 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46790 ms. Remains : 251/535 places, 241/525 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-12
Product exploration explored 100000 steps with 187 reset in 331 ms.
Product exploration explored 100000 steps with 188 reset in 382 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 150 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 5093 steps (6 resets) in 78 ms. (64 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT p0)), (F (NOT p1)), (F p2), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND (OR p0 p2) (OR p2 p1))))]
Knowledge based reduction with 13 factoid took 356 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-06-01 07:22:44] [INFO ] Invariant cache hit.
[2024-06-01 07:22:44] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 07:22:44] [INFO ] Invariant cache hit.
[2024-06-01 07:22:44] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-01 07:22:44] [INFO ] Redundant transitions in 27 ms returned []
Running 240 sub problems to find dead transitions.
[2024-06-01 07:22:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 10 places in 13 ms of which 0 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 18/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/492 variables, 251/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/492 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:55] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:22:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:22:55] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 9/394 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 410 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 69/159 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 241/492 variables, 251/410 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 240/650 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 2/654 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 654 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 73/73 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60398 ms. Remains : 251/251 places, 241/241 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 135 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 6804 steps (10 resets) in 97 ms. (69 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT p0)), (F (NOT p1)), (F p2), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND (OR p0 p2) (OR p2 p1))))]
Knowledge based reduction with 13 factoid took 347 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 187 reset in 348 ms.
Product exploration explored 100000 steps with 187 reset in 386 ms.
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 3 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-06-01 07:23:46] [INFO ] Invariant cache hit.
[2024-06-01 07:23:46] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 07:23:46] [INFO ] Invariant cache hit.
[2024-06-01 07:23:46] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-01 07:23:46] [INFO ] Redundant transitions in 24 ms returned []
Running 240 sub problems to find dead transitions.
[2024-06-01 07:23:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 18/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/492 variables, 251/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:57] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:23:57] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:23:57] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:23:57] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/492 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:23:59] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 9/394 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 410 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 69/159 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 241/492 variables, 251/410 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 240/650 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 2/654 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 654 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 73/73 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60398 ms. Remains : 251/251 places, 241/241 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-12 finished in 170820 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((F(p1)||p0))))'
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 534 transition count 475
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 485 transition count 475
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 98 place count 485 transition count 423
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 202 place count 433 transition count 423
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 205 place count 430 transition count 420
Iterating global reduction 2 with 3 rules applied. Total rules applied 208 place count 430 transition count 420
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 208 place count 430 transition count 419
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 210 place count 429 transition count 419
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 560 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 563 place count 251 transition count 242
Applied a total of 563 rules in 35 ms. Remains 251 /535 variables (removed 284) and now considering 242/525 (removed 283) transitions.
// Phase 1: matrix 242 rows 251 cols
[2024-06-01 07:24:46] [INFO ] Computed 90 invariants in 2 ms
[2024-06-01 07:24:46] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 07:24:46] [INFO ] Invariant cache hit.
[2024-06-01 07:24:46] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-01 07:24:46] [INFO ] Redundant transitions in 27 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 238 sub problems to find dead transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-06-01 07:24:46] [INFO ] Computed 90 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 2/251 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 241/492 variables, 251/389 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:00] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:25:00] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:25:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 7/396 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:02] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:25:03] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:25:03] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:25:03] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:25:03] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 6/402 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:06] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:25:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:07] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:25:07] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:09] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/492 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 6/420 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 420 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 74/160 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/251 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/420 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 238/658 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 3/661 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 662 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 83/83 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/535 places, 241/525 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60450 ms. Remains : 251/535 places, 241/525 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-13
Product exploration explored 100000 steps with 200 reset in 337 ms.
Product exploration explored 100000 steps with 202 reset in 375 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
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))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 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))]
RANDOM walk for 16824 steps (30 resets) in 89 ms. (186 steps per ms) remains 0/4 properties
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))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 208 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 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 3 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-06-01 07:25:48] [INFO ] Invariant cache hit.
[2024-06-01 07:25:48] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 07:25:48] [INFO ] Invariant cache hit.
[2024-06-01 07:25:48] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-01 07:25:48] [INFO ] Redundant transitions in 25 ms returned []
Running 238 sub problems to find dead transitions.
[2024-06-01 07:25:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 2/251 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 241/492 variables, 251/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 15/398 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:26:04] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:07] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:26:07] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:10] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:11] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:26:11] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:26:11] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 418 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 70/156 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/251 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/418 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 238/656 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 6/662 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:41] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 663 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 84/84 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60384 ms. Remains : 251/251 places, 241/241 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
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))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 10838 steps (19 resets) in 55 ms. (193 steps per ms) remains 0/4 properties
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))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 165 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 199 reset in 342 ms.
Product exploration explored 100000 steps with 197 reset in 372 ms.
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 3 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-06-01 07:26:50] [INFO ] Invariant cache hit.
[2024-06-01 07:26:50] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 07:26:50] [INFO ] Invariant cache hit.
[2024-06-01 07:26:50] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-01 07:26:50] [INFO ] Redundant transitions in 25 ms returned []
Running 238 sub problems to find dead transitions.
[2024-06-01 07:26:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 2/251 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 241/492 variables, 251/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 15/398 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:27:08] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:27:14] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:27:15] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:27:18] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:27:18] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:27:18] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 418 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 70/156 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/251 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/418 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 238/656 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 6/662 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 664 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 85/85 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60378 ms. Remains : 251/251 places, 241/241 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-13 finished in 184030 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))'
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||G(F((p1||(p2 U (p3||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(X(X(X((F(p0)||X(X(G(p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(!p1)&&F(!p2))||(p0&&X(G(!p1)))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-010B-LTLFireability-11
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 535 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 535/535 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 534 transition count 475
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 485 transition count 475
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 98 place count 485 transition count 424
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 200 place count 434 transition count 424
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 203 place count 431 transition count 421
Iterating global reduction 2 with 3 rules applied. Total rules applied 206 place count 431 transition count 421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 206 place count 431 transition count 420
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 208 place count 430 transition count 420
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 552 place count 258 transition count 248
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 554 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 555 place count 255 transition count 246
Applied a total of 555 rules in 42 ms. Remains 255 /535 variables (removed 280) and now considering 246/525 (removed 279) transitions.
// Phase 1: matrix 246 rows 255 cols
[2024-06-01 07:27:51] [INFO ] Computed 90 invariants in 1 ms
[2024-06-01 07:27:51] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 07:27:51] [INFO ] Invariant cache hit.
[2024-06-01 07:27:51] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-06-01 07:27:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 3/255 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 246/501 variables, 255/386 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/501 variables, 10/407 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:17] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:28:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:28:17] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:19] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:28:19] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:28:20] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 423 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 3/255 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 14/171 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 246/501 variables, 255/427 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 242/669 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:38] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:28:38] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 673 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 86/86 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LI_LTL mode, iteration 1 : 255/535 places, 246/525 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60453 ms. Remains : 255/535 places, 246/525 transitions.
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-11
Product exploration explored 100000 steps with 33259 reset in 228 ms.
Product exploration explored 100000 steps with 33316 reset in 261 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 128 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
RANDOM walk for 32068 steps (54 resets) in 478 ms. (66 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 20 factoid took 380 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-06-01 07:28:53] [INFO ] Invariant cache hit.
[2024-06-01 07:28:53] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 07:28:53] [INFO ] Invariant cache hit.
[2024-06-01 07:28:53] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-06-01 07:28:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 3/255 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 246/501 variables, 255/386 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:29:15] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:29:15] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/501 variables, 10/407 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:15] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:29:22] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 423 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 3/255 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 14/171 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:26] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 246/501 variables, 255/427 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 242/669 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 673 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 86/86 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Finished structural reductions in LTL mode , in 1 iterations and 60343 ms. Remains : 255/255 places, 246/246 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 118 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
RANDOM walk for 30387 steps (54 resets) in 554 ms. (54 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 20 factoid took 413 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 33258 reset in 228 ms.
Product exploration explored 100000 steps with 33365 reset in 271 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 8 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-06-01 07:29:56] [INFO ] Redundant transitions in 29 ms returned [245]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 245 rows 255 cols
[2024-06-01 07:29:56] [INFO ] Computed 90 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 3/255 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 245/500 variables, 255/380 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:30:09] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:30:09] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 9/391 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:11] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:30:11] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:18] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/500 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:19] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:30:20] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:30:21] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:30:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:30:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:30:22] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:30:22] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/500 variables, 6/409 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/500 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/500 variables, and 411 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 55/139 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 3/255 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 245/500 variables, 255/413 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 241/654 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 07:30:46] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:30:47] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:30:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 658 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 72/72 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in SI_LTL mode, iteration 1 : 255/255 places, 245/246 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60104 ms. Remains : 255/255 places, 245/246 transitions.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 1 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
// Phase 1: matrix 246 rows 255 cols
[2024-06-01 07:30:56] [INFO ] Computed 90 invariants in 1 ms
[2024-06-01 07:30:56] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 07:30:56] [INFO ] Invariant cache hit.
[2024-06-01 07:30:56] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-06-01 07:30:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:30:57] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:30:57] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:30:57] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:30:57] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:30:57] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:30:57] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:30:57] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:30:57] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:30:59] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:30:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:30:59] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:30:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:30:59] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:30:59] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:31:00] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 3/255 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 246/501 variables, 255/386 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/501 variables, 10/407 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:24] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:31:24] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:31:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:26] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:31:26] [INFO ] Deduced a trap composed of 12 places in 32 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 501/501 variables, and 423 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:27] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:31:27] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:31:27] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 3/255 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 14/171 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:29] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 246/501 variables, 255/427 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 242/669 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:33] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:31:33] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 07:31:42] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:31:42] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 673 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 86/86 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in LTL mode , in 1 iterations and 60343 ms. Remains : 255/255 places, 246/246 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-11 finished in 245882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||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' '!(F(G((F(p1)||p0))))'
[2024-06-01 07:31:56] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:31:56] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:31:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 535 places, 525 transitions and 1650 arcs took 4 ms.
Total runtime 1762760 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPs-PT-010B-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPs-PT-010B-LTLFireability-05
FORMULA ShieldIIPs-PT-010B-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-010B-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPs-PT-010B-LTLFireability-12
FORMULA ShieldIIPs-PT-010B-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717228793914

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
ltl formula name ShieldIIPs-PT-010B-LTLFireability-04
ltl formula formula --ltl=/tmp/13483/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 535 places, 525 transitions and 1650 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13483/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13483/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13483/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13483/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 537 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 527 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~340 levels ~10000 states ~29760 transitions
pnml2lts-mc( 1/ 4): ~340 levels ~20000 states ~55976 transitions
pnml2lts-mc( 2/ 4): ~338 levels ~40000 states ~128912 transitions
pnml2lts-mc( 2/ 4): ~338 levels ~80000 states ~268824 transitions
pnml2lts-mc( 2/ 4): ~338 levels ~160000 states ~554564 transitions
pnml2lts-mc( 2/ 4): ~338 levels ~320000 states ~1175392 transitions
pnml2lts-mc( 2/ 4): ~338 levels ~640000 states ~2437348 transitions
pnml2lts-mc( 0/ 4): ~380 levels ~1280000 states ~4172644 transitions
pnml2lts-mc( 0/ 4): ~380 levels ~2560000 states ~8940956 transitions
pnml2lts-mc( 0/ 4): ~380 levels ~5120000 states ~18457300 transitions
pnml2lts-mc( 0/ 4): ~380 levels ~10240000 states ~39289800 transitions
pnml2lts-mc( 0/ 4): ~380 levels ~20480000 states ~82029380 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33541088
pnml2lts-mc( 0/ 4): unique states count: 33542443
pnml2lts-mc( 0/ 4): unique transitions count: 149595608
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 116041175
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33542452
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1450
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33542452 states 149595629 transitions, fanout: 4.460
pnml2lts-mc( 0/ 4): Total exploration time 365.290 sec (365.260 sec minimum, 365.278 sec on average)
pnml2lts-mc( 0/ 4): States per second: 91824, Transitions per second: 409526
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 286.0MB, 8.9 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/46.0%
pnml2lts-mc( 0/ 4): Stored 537 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 286.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-010B-LTLFireability-05
ltl formula formula --ltl=/tmp/13483/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 535 places, 525 transitions and 1650 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13483/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13483/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13483/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13483/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 536 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 583 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1147 levels ~10000 states ~60092 transitions
pnml2lts-mc( 2/ 4): ~1147 levels ~20000 states ~101780 transitions
pnml2lts-mc( 2/ 4): ~1147 levels ~40000 states ~198960 transitions
pnml2lts-mc( 2/ 4): ~1147 levels ~80000 states ~413948 transitions
pnml2lts-mc( 2/ 4): ~1187 levels ~160000 states ~812484 transitions
pnml2lts-mc( 2/ 4): ~1187 levels ~320000 states ~1728344 transitions
pnml2lts-mc( 2/ 4): ~1187 levels ~640000 states ~3868828 transitions
pnml2lts-mc( 2/ 4): ~1187 levels ~1280000 states ~8162388 transitions
pnml2lts-mc( 2/ 4): ~1187 levels ~2560000 states ~17570384 transitions
pnml2lts-mc( 0/ 4): ~1298 levels ~5120000 states ~38094332 transitions
pnml2lts-mc( 2/ 4): ~1187 levels ~10240000 states ~77506120 transitions
pnml2lts-mc( 2/ 4): ~1187 levels ~20480000 states ~165319944 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30244288
pnml2lts-mc( 0/ 4): unique states count: 30249255
pnml2lts-mc( 0/ 4): unique transitions count: 245820479
pnml2lts-mc( 0/ 4): - self-loop count: 66
pnml2lts-mc( 0/ 4): - claim dead count: 215528574
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 30249267
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5075
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30249267 states 245820517 transitions, fanout: 8.126
pnml2lts-mc( 0/ 4): Total exploration time 357.980 sec (357.970 sec minimum, 357.973 sec on average)
pnml2lts-mc( 0/ 4): States per second: 84500, Transitions per second: 686688
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 295.1MB, 10.2 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 90.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 537 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 295.1MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-010B-LTLFireability-10
ltl formula formula --ltl=/tmp/13483/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 535 places, 525 transitions and 1650 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13483/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13483/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13483/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13483/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 537 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 553 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17
pnml2lts-mc( 0/ 4): unique states count: 17
pnml2lts-mc( 0/ 4): unique transitions count: 21
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 11
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 39
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 39 states 69 transitions, fanout: 1.769
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3900, Transitions per second: 6900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 86.1 B/state, compr.: 4.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 537 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-010B-LTLFireability-11
ltl formula formula --ltl=/tmp/13483/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 535 places, 525 transitions and 1650 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13483/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13483/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13483/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13483/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 536 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 609 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1176 levels ~10000 states ~100320 transitions
pnml2lts-mc( 0/ 4): ~1176 levels ~20000 states ~145672 transitions
pnml2lts-mc( 0/ 4): ~1176 levels ~40000 states ~253024 transitions
pnml2lts-mc( 0/ 4): ~1176 levels ~80000 states ~458456 transitions
pnml2lts-mc( 0/ 4): ~1176 levels ~160000 states ~923304 transitions
pnml2lts-mc( 0/ 4): ~1218 levels ~320000 states ~1800680 transitions
pnml2lts-mc( 0/ 4): ~1218 levels ~640000 states ~2928996 transitions
pnml2lts-mc( 0/ 4): ~1218 levels ~1280000 states ~5230948 transitions
pnml2lts-mc( 0/ 4): ~1218 levels ~2560000 states ~10319840 transitions
pnml2lts-mc( 0/ 4): ~1218 levels ~5120000 states ~21165384 transitions
pnml2lts-mc( 0/ 4): ~1218 levels ~10240000 states ~43621688 transitions
pnml2lts-mc( 1/ 4): ~1262 levels ~20480000 states ~139835796 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33496520
pnml2lts-mc( 0/ 4): unique states count: 33501356
pnml2lts-mc( 0/ 4): unique transitions count: 256284782
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 222695220
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33501372
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4940
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33501372 states 256284872 transitions, fanout: 7.650
pnml2lts-mc( 0/ 4): Total exploration time 394.900 sec (394.880 sec minimum, 394.888 sec on average)
pnml2lts-mc( 0/ 4): States per second: 84835, Transitions per second: 648987
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 313.8MB, 9.8 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/90.0%
pnml2lts-mc( 0/ 4): Stored 537 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 313.8MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-010B-LTLFireability-12
ltl formula formula --ltl=/tmp/13483/ltl_4_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 535 places, 525 transitions and 1650 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.030 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13483/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13483/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13483/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13483/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 536 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 559 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~1183 levels ~10000 states ~58888 transitions
pnml2lts-mc( 3/ 4): ~1183 levels ~20000 states ~104372 transitions
pnml2lts-mc( 2/ 4): ~1168 levels ~40000 states ~202456 transitions
pnml2lts-mc( 2/ 4): ~1168 levels ~80000 states ~425316 transitions
pnml2lts-mc( 1/ 4): ~1404 levels ~160000 states ~827800 transitions
pnml2lts-mc( 2/ 4): ~1200 levels ~320000 states ~1819392 transitions
pnml2lts-mc( 2/ 4): ~1200 levels ~640000 states ~3951752 transitions
pnml2lts-mc( 2/ 4): ~1200 levels ~1280000 states ~8334772 transitions
pnml2lts-mc( 2/ 4): ~1200 levels ~2560000 states ~18070688 transitions
pnml2lts-mc( 2/ 4): ~1200 levels ~5120000 states ~36922888 transitions
pnml2lts-mc( 2/ 4): ~1200 levels ~10240000 states ~78663836 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12173842
pnml2lts-mc( 0/ 4): unique states count: 12178919
pnml2lts-mc( 0/ 4): unique transitions count: 92612602
pnml2lts-mc( 0/ 4): - self-loop count: 60
pnml2lts-mc( 0/ 4): - claim dead count: 80395415
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12178928
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5179
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12178928 states 92612623 transitions, fanout: 7.604
pnml2lts-mc( 0/ 4): Total exploration time 142.300 sec (142.290 sec minimum, 142.295 sec on average)
pnml2lts-mc( 0/ 4): States per second: 85586, Transitions per second: 650827
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 157.2MB, 13.5 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 36.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 537 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 157.2MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-010B-LTLFireability-13
ltl formula formula --ltl=/tmp/13483/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 535 places, 525 transitions and 1650 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13483/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13483/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13483/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13483/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 536 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 536, there are 537 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1184 levels ~10000 states ~49088 transitions
pnml2lts-mc( 2/ 4): ~1184 levels ~20000 states ~90440 transitions
pnml2lts-mc( 2/ 4): ~1184 levels ~40000 states ~180004 transitions
pnml2lts-mc( 2/ 4): ~1184 levels ~80000 states ~355240 transitions
pnml2lts-mc( 2/ 4): ~1184 levels ~160000 states ~725496 transitions
pnml2lts-mc( 2/ 4): ~1184 levels ~320000 states ~1596128 transitions
pnml2lts-mc( 2/ 4): ~1184 levels ~640000 states ~3400228 transitions
pnml2lts-mc( 1/ 4): ~1319 levels ~1280000 states ~7779736 transitions
pnml2lts-mc( 2/ 4): ~1201 levels ~2560000 states ~14474616 transitions
pnml2lts-mc( 2/ 4): ~1201 levels ~5120000 states ~29864868 transitions
pnml2lts-mc( 2/ 4): ~1240 levels ~10240000 states ~61853464 transitions
pnml2lts-mc( 2/ 4): ~1240 levels ~20480000 states ~131419224 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33516202
pnml2lts-mc( 0/ 4): unique states count: 33521468
pnml2lts-mc( 0/ 4): unique transitions count: 251475007
pnml2lts-mc( 0/ 4): - self-loop count: 95
pnml2lts-mc( 0/ 4): - claim dead count: 217920548
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33521478
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5385
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33521478 states 251475030 transitions, fanout: 7.502
pnml2lts-mc( 0/ 4): Total exploration time 413.200 sec (413.180 sec minimum, 413.190 sec on average)
pnml2lts-mc( 0/ 4): States per second: 81127, Transitions per second: 608604
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 317.1MB, 9.9 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/95.0%
pnml2lts-mc( 0/ 4): Stored 537 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 317.1MB (~256.0MB paged-in)

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="ShieldIIPs-PT-010B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPs-PT-010B, 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 r528-tall-171683760300092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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