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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 66K 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-004B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716881866115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 07:37:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 07:37:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:37:47] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-28 07:37:47] [INFO ] Transformed 243 places.
[2024-05-28 07:37:47] [INFO ] Transformed 239 transitions.
[2024-05-28 07:37:47] [INFO ] Found NUPN structural information;
[2024-05-28 07:37:47] [INFO ] Parsed PT model containing 243 places and 239 transitions and 718 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 222 transition count 218
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 222 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 221 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 221 transition count 217
Applied a total of 44 rules in 56 ms. Remains 221 /243 variables (removed 22) and now considering 217/239 (removed 22) transitions.
// Phase 1: matrix 217 rows 221 cols
[2024-05-28 07:37:47] [INFO ] Computed 37 invariants in 19 ms
[2024-05-28 07:37:47] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-28 07:37:47] [INFO ] Invariant cache hit.
[2024-05-28 07:37:48] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-28 07:37:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 12 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:37:50] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-28 07:37:51] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:37:52] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:37:54] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-05-28 07:37:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:37:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:37:55] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:37:55] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:37:55] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:37:55] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:37:55] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-28 07:37:55] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:37:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:37:56] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:37:56] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:37:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:37:56] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:37:56] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-28 07:37:56] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:37:57] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:37:57] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:37:58] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:00] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 217/438 variables, 221/338 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:02] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:38:02] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:38:03] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:38:03] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:38:03] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:38:03] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:03] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:03] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:03] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:38:03] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:38:03] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:04] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:38:05] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:05] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:38:05] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:05] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:38:05] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:38:05] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:05] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 9/367 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:38:09] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 10/377 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:09] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:38:12] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:38:12] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:12] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:38:12] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:38:12] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:38:13] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:13] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:15] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 415 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 157/157 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 157/194 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 9/223 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:22] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:38:22] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:38:22] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:38:22] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:38:22] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:23] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:24] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:38:24] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:25] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:38:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:38:26] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:26] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:38:26] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:26] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 2 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:29] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:30] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:38:30] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 7/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 7/287 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:34] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:38:35] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:38:35] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:38:35] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:38:35] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 5/292 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:36] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 3 ms to minimize.
[2024-05-28 07:38:36] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:36] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:38:36] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:38:36] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:38:36] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:37] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:38] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:38:38] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:38] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:40] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:40] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:40] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:40] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:38:40] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:38:40] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:40] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:38:40] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/221 variables, 8/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/221 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 20 (OVERLAPS) 217/438 variables, 221/531 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/438 variables, 216/747 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:38:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:38:46] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:38:46] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:38:47] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:38:47] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 752 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 278/278 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 221/243 places, 217/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60650 ms. Remains : 221/243 places, 217/239 transitions.
Support contains 25 out of 221 places after structural reductions.
[2024-05-28 07:38:48] [INFO ] Flatten gal took : 39 ms
[2024-05-28 07:38:48] [INFO ] Flatten gal took : 19 ms
[2024-05-28 07:38:48] [INFO ] Input system was already deterministic with 217 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 6874 steps (9 resets) in 250 ms. (27 steps per ms) remains 0/17 properties
Computed a total of 51 stabilizing places and 51 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' '!(X((F(X(p0))||G((X(p1) U p2)))))'
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 215 transition count 211
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 215 transition count 211
Applied a total of 12 rules in 10 ms. Remains 215 /221 variables (removed 6) and now considering 211/217 (removed 6) transitions.
// Phase 1: matrix 211 rows 215 cols
[2024-05-28 07:38:48] [INFO ] Computed 37 invariants in 5 ms
[2024-05-28 07:38:48] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 07:38:48] [INFO ] Invariant cache hit.
[2024-05-28 07:38:49] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-28 07:38:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:38:50] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:38:50] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:38:50] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:38:50] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:38:51] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:38:52] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:53] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:38:54] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:38:54] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:38:54] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:38:54] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:38:54] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:38:56] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:38:56] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:38:56] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:38:57] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:38:57] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:38:59] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:38:59] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:38:59] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 211/426 variables, 215/318 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:01] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:39:02] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:39:02] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:39:02] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-28 07:39:02] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:39:02] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:39:02] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:39:02] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 4 ms to minimize.
[2024-05-28 07:39:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 19/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:39:04] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:39:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:39:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:39:04] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:39:04] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:39:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:39:04] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:39:05] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:39:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 12/349 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:05] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:05] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2024-05-28 07:39:06] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-28 07:39:06] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:06] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:39:06] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:39:06] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:08] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:39:09] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:39:09] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:39:09] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:39:09] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:10] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:39:10] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:10] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:39:11] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:11] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:39:11] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:39:11] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:39:11] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:39:11] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:39:11] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:39:11] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:39:12] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 10/374 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:12] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:39:12] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:39:12] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:39:12] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:39:12] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 13/387 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:15] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 12/405 constraints. Problems are: Problem set: 0 solved, 210 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 426/426 variables, and 405 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 153/153 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 153/190 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/426 variables, 215/405 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 210/615 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:23] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:39:23] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-28 07:39:23] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-28 07:39:24] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:39:24] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:39:24] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:39:24] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:39:24] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:39:26] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:39:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:39:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:30] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:30] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:39:30] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:39:30] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:39:31] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:39:31] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:39:31] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 8/643 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:36] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:39:36] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:39:37] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:39:37] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:39:37] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-28 07:39:37] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2024-05-28 07:39:37] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:39:37] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:39:37] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:39:37] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:39:38] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:39:38] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:39:39] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 13/656 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:39:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:39:45] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-28 07:39:45] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:39:46] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:39:46] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:39:46] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:39:47] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 663 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 201/201 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 215/221 places, 211/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60300 ms. Remains : 215/221 places, 211/217 transitions.
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-01
Product exploration explored 100000 steps with 814 reset in 418 ms.
Product exploration explored 100000 steps with 806 reset in 291 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 110 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 40000 steps (68 resets) in 585 ms. (68 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2024-05-28 07:39:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/215 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 211/426 variables, 215/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/426 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 252 constraints, problems are : Problem set: 0 solved, 2 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Int declared 53/426 variables, and 8 constraints, problems are : Problem set: 2 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 8/37 constraints, State Equation: 0/215 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 161ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 p2)), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-01 finished in 62264 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(p1)))'
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 214 transition count 210
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 214 transition count 210
Applied a total of 14 rules in 15 ms. Remains 214 /221 variables (removed 7) and now considering 210/217 (removed 7) transitions.
// Phase 1: matrix 210 rows 214 cols
[2024-05-28 07:39:51] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:39:51] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 07:39:51] [INFO ] Invariant cache hit.
[2024-05-28 07:39:51] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-28 07:39:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:53] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:39:53] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:39:53] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:39:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 3 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 5 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:57] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:40:00] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:40:00] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:01] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:02] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:40:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:40:02] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:40:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:03] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:40:03] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:40:03] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:05] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:40:05] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:40:06] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:40:06] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:40:06] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:40:06] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:40:06] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:40:06] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:40:06] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-05-28 07:40:07] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:40:07] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:40:07] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:40:07] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:40:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:40:07] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:40:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:40:07] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:08] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:40:08] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:40:08] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:40:09] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:10] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:40:10] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:40:12] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:40:12] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:40:12] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:40:12] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:40:12] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:40:12] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:12] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:14] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:40:15] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:40:15] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:18] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:40:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:18] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:40:19] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:40:19] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:40:19] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:40:19] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:40:19] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:20] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-28 07:40:20] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:40:20] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:40:21] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:40:21] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:40:21] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 390 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 139/139 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 139/176 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:22] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:40:23] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:40:23] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/424 variables, 214/393 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 209/602 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:26] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:40:26] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:40:27] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:40:27] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:40:27] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:40:28] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:40:28] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:40:28] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:40:28] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:40:28] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:40:28] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:40:30] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:40:30] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 13/615 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:40:39] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:40:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:40:39] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:40:39] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:40:40] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:40:40] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:40:40] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:40:41] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:40:41] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:40:41] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:40:41] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:40:41] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 13/628 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 628 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 168/168 constraints]
After SMT, in 60054ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 214/221 places, 210/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60450 ms. Remains : 214/221 places, 210/217 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-03 finished in 60599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 220 transition count 197
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 201 transition count 197
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 38 place count 201 transition count 175
Deduced a syphon composed of 22 places in 11 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 82 place count 179 transition count 175
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 172 transition count 168
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 172 transition count 168
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 96 place count 172 transition count 165
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 169 transition count 165
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 230 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 102 transition count 99
Applied a total of 233 rules in 87 ms. Remains 102 /221 variables (removed 119) and now considering 99/217 (removed 118) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-05-28 07:40:51] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 07:40:51] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-28 07:40:51] [INFO ] Invariant cache hit.
[2024-05-28 07:40:52] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-28 07:40:52] [INFO ] Redundant transitions in 40 ms returned [98]
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 95 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-05-28 07:40:52] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:40:52] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:40:52] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:40:52] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:40:52] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:40:52] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:40:52] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:40:52] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:40:52] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 32 ms to minimize.
[2024-05-28 07:40:52] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 2/102 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:40:53] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:40:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:40:53] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:40:53] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:40:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:40:53] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:40:54] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:40:54] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:40:54] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:40:54] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:40:55] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:40:56] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:40:56] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:40:56] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:40:56] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (OVERLAPS) 0/200 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 172 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5753 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:40:57] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:40:58] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/102 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 95/269 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:40:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:41:00] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:41:01] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (OVERLAPS) 0/200 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 272 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6801 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 39/39 constraints]
After SMT, in 12570ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 12571ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/221 places, 98/217 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12945 ms. Remains : 102/221 places, 98/217 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-04
Stuttering criterion allowed to conclude after 230 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-04 finished in 13006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 220 transition count 195
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 199 transition count 195
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 42 place count 199 transition count 174
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 84 place count 178 transition count 174
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 171 transition count 167
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 171 transition count 167
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 98 place count 171 transition count 164
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 168 transition count 164
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 230 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 102 transition count 99
Applied a total of 233 rules in 29 ms. Remains 102 /221 variables (removed 119) and now considering 99/217 (removed 118) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-05-28 07:41:04] [INFO ] Computed 36 invariants in 2 ms
[2024-05-28 07:41:04] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 07:41:04] [INFO ] Invariant cache hit.
[2024-05-28 07:41:04] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-28 07:41:04] [INFO ] Redundant transitions in 21 ms returned [98]
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 96 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-05-28 07:41:04] [INFO ] Computed 36 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:05] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:06] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:41:06] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:41:06] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:41:06] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:41:06] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 98/200 variables, 102/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:41:07] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:41:07] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:41:07] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:41:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:41:07] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:41:07] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:41:09] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:41:09] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/200 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 164 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5694 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 96/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:11] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:41:11] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:41:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 263 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3661 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 29/29 constraints]
After SMT, in 9373ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9374ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/221 places, 98/217 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9592 ms. Remains : 102/221 places, 98/217 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-06
Product exploration explored 100000 steps with 1420 reset in 229 ms.
Product exploration explored 100000 steps with 1497 reset in 258 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:41:15] [INFO ] Invariant cache hit.
[2024-05-28 07:41:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 07:41:15] [INFO ] Invariant cache hit.
[2024-05-28 07:41:15] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-28 07:41:15] [INFO ] Redundant transitions in 23 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-28 07:41:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:15] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:41:15] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 07:41:16] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:41:16] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:41:16] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:41:16] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:41:16] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:16] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:17] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:41:17] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:41:17] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:41:17] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:41:17] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 98/200 variables, 102/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:17] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:41:17] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:41:18] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:41:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:41:18] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:41:18] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:41:18] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:18] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:19] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:41:20] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:41:20] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/200 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 164 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5809 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 96/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:41:22] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:23] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:25] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:29] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:31] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:34] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/200 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:41:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/200 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/200 variables, and 269 constraints, problems are : Problem set: 0 solved, 96 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 35/35 constraints]
After SMT, in 35845ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 35846ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36013 ms. Remains : 102/102 places, 98/98 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1376 reset in 196 ms.
Product exploration explored 100000 steps with 1349 reset in 212 ms.
Built C files in :
/tmp/ltsmin223537803330602368
[2024-05-28 07:41:52] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 07:41:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:41:52] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 07:41:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:41:52] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 07:41:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:41:52] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin223537803330602368
Running compilation step : cd /tmp/ltsmin223537803330602368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 377 ms.
Running link step : cd /tmp/ltsmin223537803330602368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin223537803330602368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9928492965239992102.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:42:07] [INFO ] Invariant cache hit.
[2024-05-28 07:42:07] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-28 07:42:07] [INFO ] Invariant cache hit.
[2024-05-28 07:42:07] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-28 07:42:07] [INFO ] Redundant transitions in 19 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-28 07:42:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:08] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:42:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:42:08] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:42:08] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:42:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:42:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:42:08] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:08] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:08] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:09] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:42:09] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:42:09] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:42:09] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:42:09] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 98/200 variables, 102/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:42:10] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:42:10] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:42:10] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:42:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:42:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:42:10] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:11] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:11] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:12] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:42:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:42:12] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/200 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 164 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5851 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 96/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:14] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:42:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:16] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:17] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:21] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:23] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:26] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:28] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/200 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:42:36] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/200 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/200 variables, and 269 constraints, problems are : Problem set: 0 solved, 96 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 35/35 constraints]
After SMT, in 35883ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 35886ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36072 ms. Remains : 102/102 places, 98/98 transitions.
Built C files in :
/tmp/ltsmin17260490336372761533
[2024-05-28 07:42:43] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 07:42:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:42:43] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 07:42:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:42:43] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 07:42:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:42:43] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17260490336372761533
Running compilation step : cd /tmp/ltsmin17260490336372761533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 242 ms.
Running link step : cd /tmp/ltsmin17260490336372761533;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17260490336372761533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10413087041385640137.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 07:42:58] [INFO ] Flatten gal took : 8 ms
[2024-05-28 07:42:59] [INFO ] Flatten gal took : 7 ms
[2024-05-28 07:42:59] [INFO ] Time to serialize gal into /tmp/LTL16834029747426824187.gal : 3 ms
[2024-05-28 07:42:59] [INFO ] Time to serialize properties into /tmp/LTL7586413316052285107.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16834029747426824187.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11938340745239779540.hoa' '-atoms' '/tmp/LTL7586413316052285107.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7586413316052285107.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11938340745239779540.hoa
Detected timeout of ITS tools.
[2024-05-28 07:43:14] [INFO ] Flatten gal took : 7 ms
[2024-05-28 07:43:14] [INFO ] Flatten gal took : 6 ms
[2024-05-28 07:43:14] [INFO ] Time to serialize gal into /tmp/LTL223990219499125145.gal : 2 ms
[2024-05-28 07:43:14] [INFO ] Time to serialize properties into /tmp/LTL5555382589771892412.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL223990219499125145.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5555382589771892412.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F("((p31==0)||(p21==1))"))))
Formula 0 simplified : FG!"((p31==0)||(p21==1))"
Detected timeout of ITS tools.
[2024-05-28 07:43:29] [INFO ] Flatten gal took : 7 ms
[2024-05-28 07:43:29] [INFO ] Applying decomposition
[2024-05-28 07:43:29] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6262168717046555779.txt' '-o' '/tmp/graph6262168717046555779.bin' '-w' '/tmp/graph6262168717046555779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6262168717046555779.bin' '-l' '-1' '-v' '-w' '/tmp/graph6262168717046555779.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:43:29] [INFO ] Decomposing Gal with order
[2024-05-28 07:43:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:43:29] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-28 07:43:29] [INFO ] Flatten gal took : 70 ms
[2024-05-28 07:43:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 6 ms.
[2024-05-28 07:43:29] [INFO ] Time to serialize gal into /tmp/LTL14171826343343822773.gal : 12 ms
[2024-05-28 07:43:29] [INFO ] Time to serialize properties into /tmp/LTL18318795525753583838.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14171826343343822773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18318795525753583838.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i1.u7.p31==0)||(i0.i0.u2.p21==1))"))))
Formula 0 simplified : FG!"((i0.i1.u7.p31==0)||(i0.i0.u2.p21==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-06 finished in 159672 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)&&F(G(p1)))))'
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 220 transition count 195
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 199 transition count 195
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 42 place count 199 transition count 174
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 84 place count 178 transition count 174
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 90 place count 172 transition count 168
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 172 transition count 168
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 96 place count 172 transition count 165
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 169 transition count 165
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 230 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 102 transition count 99
Applied a total of 233 rules in 27 ms. Remains 102 /221 variables (removed 119) and now considering 99/217 (removed 118) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-05-28 07:43:44] [INFO ] Computed 36 invariants in 0 ms
[2024-05-28 07:43:44] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 07:43:44] [INFO ] Invariant cache hit.
[2024-05-28 07:43:44] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-28 07:43:44] [INFO ] Redundant transitions in 16 ms returned [98]
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 97 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-05-28 07:43:44] [INFO ] Computed 36 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:43:44] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:43:44] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:43:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:43:45] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:43:45] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:43:45] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:43:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:43:45] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:43:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/200 variables, 102/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:43:45] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 148 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2308 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/200 variables, 102/148 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 97/245 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:43:47] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:43:48] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:43:48] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:43:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:43:49] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 250 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 15/15 constraints]
After SMT, in 7417ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 7418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/221 places, 98/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7655 ms. Remains : 102/221 places, 98/217 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-07
Product exploration explored 100000 steps with 2020 reset in 214 ms.
Product exploration explored 100000 steps with 1952 reset in 245 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), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 2115 steps (6 resets) in 12 ms. (162 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:43:53] [INFO ] Invariant cache hit.
[2024-05-28 07:43:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 07:43:53] [INFO ] Invariant cache hit.
[2024-05-28 07:43:53] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-28 07:43:53] [INFO ] Redundant transitions in 17 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 07:43:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:43:53] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:43:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:43:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:43:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:43:53] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:43:53] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:43:53] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:43:54] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:43:54] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/200 variables, 102/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:43:54] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:43:54] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:43:54] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 150 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2407 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/200 variables, 102/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 97/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 247 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2115 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 12/12 constraints]
After SMT, in 4541ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 4542ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4707 ms. Remains : 102/102 places, 98/98 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 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1120 steps (3 resets) in 8 ms. (124 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2042 reset in 184 ms.
Product exploration explored 100000 steps with 1960 reset in 204 ms.
Built C files in :
/tmp/ltsmin8466798293412794169
[2024-05-28 07:43:59] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 07:43:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:43:59] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 07:43:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:43:59] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 07:43:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:43:59] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8466798293412794169
Running compilation step : cd /tmp/ltsmin8466798293412794169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 245 ms.
Running link step : cd /tmp/ltsmin8466798293412794169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8466798293412794169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2106045567254481592.hoa' '--buchi-type=spotba'
LTSmin run took 1605 ms.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-07 finished in 16701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((G(p0) U p1))&&((p1 U X(p3))||p2))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 216 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 216 transition count 212
Applied a total of 10 rules in 9 ms. Remains 216 /221 variables (removed 5) and now considering 212/217 (removed 5) transitions.
// Phase 1: matrix 212 rows 216 cols
[2024-05-28 07:44:01] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 07:44:01] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 07:44:01] [INFO ] Invariant cache hit.
[2024-05-28 07:44:01] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-28 07:44:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:02] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:44:03] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:44:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:44:05] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:44:05] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:44:05] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:44:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:44:05] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:44:05] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:44:05] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:44:05] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:44:05] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:44:05] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:06] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:44:06] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:44:06] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:44:06] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:44:06] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:44:06] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:44:07] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:44:07] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:44:07] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:44:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:44:07] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:44:07] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:44:07] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:07] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:09] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:44:09] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:44:09] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:10] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:44:10] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:44:11] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:44:11] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:11] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:44:11] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:44:11] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:44:12] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:44:12] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:44:12] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:44:12] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 7/105 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:13] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:44:13] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:14] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:15] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:44:16] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:44:16] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:44:16] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:44:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:17] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-28 07:44:17] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-28 07:44:17] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:44:17] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:44:17] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:44:17] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:19] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:44:19] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:44:20] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 16 (OVERLAPS) 212/428 variables, 216/339 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:22] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:44:22] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:44:22] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:44:22] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:44:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:44:23] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:44:23] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:44:23] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:44:23] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:44:23] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:44:23] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:44:23] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:44:23] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:44:23] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:44:23] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 15/354 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:24] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:44:24] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:44:24] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:44:24] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:44:24] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:44:25] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:44:25] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:44:25] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:44:25] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:44:25] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:44:25] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:44:25] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 12/366 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:27] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
[2024-05-28 07:44:27] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:44:27] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:44:27] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:44:28] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:44:29] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:44:30] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:44:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:44:30] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:44:30] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:44:30] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:44:30] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:44:30] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:44:30] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:44:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/428 variables, and 404 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 151/151 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 151/188 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:32] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:44:32] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:44:32] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:44:32] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:44:32] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:44:33] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:44:33] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:44:33] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:44:33] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/428 variables, 216/413 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 211/624 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:36] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:44:37] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:44:37] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:44:37] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:44:38] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:44:38] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 6/630 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:45] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:44:45] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:44:46] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:44:46] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:44:46] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:44:46] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-28 07:44:46] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:44:47] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:44:47] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:44:47] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:44:47] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 11/641 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:44:54] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:44:54] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:44:55] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:44:55] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:44:56] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:44:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:44:56] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 7/648 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 648 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 184/184 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in LTL mode, iteration 1 : 216/221 places, 212/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60277 ms. Remains : 216/221 places, 212/217 transitions.
Stuttering acceptance computed with spot in 536 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X p1), (X (NOT (AND p2 p1 (NOT p3)))), (X p3), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND p2 (NOT p1) (NOT p3)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 29 factoid took 17 ms. Reduced automaton from 11 states, 45 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-08 finished in 61077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 220 transition count 195
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 199 transition count 195
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 42 place count 199 transition count 174
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 84 place count 178 transition count 174
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 171 transition count 167
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 171 transition count 167
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 98 place count 171 transition count 164
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 168 transition count 164
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 234 place count 103 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 101 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 100 transition count 97
Applied a total of 237 rules in 24 ms. Remains 100 /221 variables (removed 121) and now considering 97/217 (removed 120) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 07:45:02] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 07:45:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 07:45:02] [INFO ] Invariant cache hit.
[2024-05-28 07:45:02] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-28 07:45:02] [INFO ] Redundant transitions in 20 ms returned [96]
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 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 100 cols
[2024-05-28 07:45:02] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:45:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:45:02] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:45:02] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:45:02] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:45:02] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:45:02] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:45:02] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:45:02] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:45:02] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:45:03] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:45:03] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:45:03] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/196 variables, 100/148 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:45:03] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:45:03] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:45:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:45:03] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:45:04] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:45:04] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:45:04] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:45:04] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:45:05] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:45:05] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:45:05] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:45:05] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/196 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 160 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4355 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/196 variables, 100/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 95/255 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:45:07] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:45:07] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 257 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3224 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 26/26 constraints]
After SMT, in 7594ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7595ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/221 places, 96/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7795 ms. Remains : 100/221 places, 96/217 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-09
Stuttering criterion allowed to conclude after 741 steps with 2 reset in 5 ms.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-09 finished in 7859 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))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 215 transition count 211
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 215 transition count 211
Applied a total of 12 rules in 7 ms. Remains 215 /221 variables (removed 6) and now considering 211/217 (removed 6) transitions.
// Phase 1: matrix 211 rows 215 cols
[2024-05-28 07:45:10] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:45:10] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 07:45:10] [INFO ] Invariant cache hit.
[2024-05-28 07:45:10] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-28 07:45:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:11] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:45:11] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 07:45:12] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-28 07:45:13] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:45:14] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:45:14] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:45:14] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-05-28 07:45:14] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:45:14] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:45:14] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:45:14] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:45:14] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:45:14] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:15] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:45:15] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:45:15] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:45:15] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-28 07:45:15] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:45:15] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:45:15] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:45:15] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:45:16] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:17] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:45:17] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:45:17] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:45:17] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:45:17] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:45:17] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:45:17] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:45:17] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:18] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-28 07:45:18] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:45:18] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:45:18] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:45:18] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:20] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:21] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:45:21] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:45:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:45:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:45:21] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:45:21] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:45:21] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:22] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:45:22] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:45:22] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:45:22] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:45:22] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:45:22] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:24] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:45:24] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:45:24] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:45:24] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:45:24] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:45:24] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:25] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 211/426 variables, 215/346 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:28] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:45:28] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:45:28] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:45:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:45:28] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:45:28] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:45:28] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:45:29] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 8/354 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:45:30] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 13/367 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:32] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:45:33] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:45:34] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:45:34] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:45:34] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:45:34] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 19/386 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:35] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:45:36] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:45:36] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:36] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:45:36] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:39] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:45:39] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:45:39] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:45:39] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:45:40] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:45:40] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:45:40] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:45:40] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 399 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 147/147 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 147/184 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:41] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:45:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:45:41] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 211/426 variables, 215/402 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 210/612 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:44] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:45:44] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:45:45] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:45:45] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:45:46] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:45:46] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:45:46] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:45:46] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-05-28 07:45:47] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:45:47] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 10/622 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:45:54] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:45:54] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-28 07:45:54] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:45:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:45:55] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:45:55] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:45:55] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:45:56] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:45:56] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:45:56] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 10/632 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:46:02] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:46:02] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-28 07:46:02] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:46:03] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:46:03] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:46:05] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 6/638 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 638 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 176/176 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 215/221 places, 211/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60274 ms. Remains : 215/221 places, 211/217 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-11 finished in 60592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 220 transition count 196
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 200 transition count 196
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 40 place count 200 transition count 175
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 82 place count 179 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 174 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 174 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 92 place count 174 transition count 169
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 94 place count 173 transition count 169
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 230 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 102 transition count 99
Applied a total of 233 rules in 26 ms. Remains 102 /221 variables (removed 119) and now considering 99/217 (removed 118) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-05-28 07:46:10] [INFO ] Computed 36 invariants in 2 ms
[2024-05-28 07:46:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 07:46:10] [INFO ] Invariant cache hit.
[2024-05-28 07:46:10] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-28 07:46:10] [INFO ] Redundant transitions in 19 ms returned [98]
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 96 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-05-28 07:46:10] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:46:11] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:12] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:46:12] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:46:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:46:12] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:46:12] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:46:12] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:46:12] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:46:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/158 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:13] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:13] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:46:13] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:14] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:14] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 163 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4944 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 98/200 variables, 102/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 96/259 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:16] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 260 constraints, problems are : Problem set: 0 solved, 96 unsolved in 9818 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
After SMT, in 14779ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 14780ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/221 places, 98/217 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14986 ms. Remains : 102/221 places, 98/217 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-12
Product exploration explored 100000 steps with 416 reset in 202 ms.
Product exploration explored 100000 steps with 416 reset in 237 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:46:26] [INFO ] Invariant cache hit.
[2024-05-28 07:46:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 07:46:26] [INFO ] Invariant cache hit.
[2024-05-28 07:46:26] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-28 07:46:26] [INFO ] Redundant transitions in 21 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-28 07:46:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:46:27] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:28] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:46:28] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:46:28] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:46:28] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:46:28] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:46:28] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:46:28] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:46:28] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:46:28] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:46:29] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:46:29] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:46:29] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:46:29] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 164 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3570 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 98/200 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 96/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:31] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:32] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 262 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4032 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 28/28 constraints]
After SMT, in 7616ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 7619ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7789 ms. Remains : 102/102 places, 98/98 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 7 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 420 reset in 195 ms.
Product exploration explored 100000 steps with 421 reset in 217 ms.
Built C files in :
/tmp/ltsmin874356393051204103
[2024-05-28 07:46:35] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 07:46:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:46:35] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 07:46:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:46:35] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 07:46:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:46:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin874356393051204103
Running compilation step : cd /tmp/ltsmin874356393051204103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 244 ms.
Running link step : cd /tmp/ltsmin874356393051204103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin874356393051204103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13391450601135509757.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:46:50] [INFO ] Invariant cache hit.
[2024-05-28 07:46:50] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 07:46:50] [INFO ] Invariant cache hit.
[2024-05-28 07:46:50] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-28 07:46:50] [INFO ] Redundant transitions in 21 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-28 07:46:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:50] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:46:50] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 07:46:51] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:46:51] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:46:51] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:46:51] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:46:51] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:46:51] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:46:51] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:46:51] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:51] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:46:51] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:52] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:46:52] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:46:52] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:46:52] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:46:52] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:46:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:46:52] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:46:52] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:46:52] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:53] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:46:53] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:46:53] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:46:53] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:46:53] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 164 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3576 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 98/200 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 96/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:55] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:46:56] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 262 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3988 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 28/28 constraints]
After SMT, in 7581ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 7583ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7776 ms. Remains : 102/102 places, 98/98 transitions.
Built C files in :
/tmp/ltsmin17149820099677339034
[2024-05-28 07:46:58] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 07:46:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:46:58] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 07:46:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:46:58] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 07:46:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:46:58] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17149820099677339034
Running compilation step : cd /tmp/ltsmin17149820099677339034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 262 ms.
Running link step : cd /tmp/ltsmin17149820099677339034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17149820099677339034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1184196245155528203.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 07:47:13] [INFO ] Flatten gal took : 6 ms
[2024-05-28 07:47:13] [INFO ] Flatten gal took : 9 ms
[2024-05-28 07:47:13] [INFO ] Time to serialize gal into /tmp/LTL18358821155152530776.gal : 2 ms
[2024-05-28 07:47:13] [INFO ] Time to serialize properties into /tmp/LTL1538044459993450115.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18358821155152530776.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13454934982346259926.hoa' '-atoms' '/tmp/LTL1538044459993450115.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1538044459993450115.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13454934982346259926.hoa
Detected timeout of ITS tools.
[2024-05-28 07:47:28] [INFO ] Flatten gal took : 6 ms
[2024-05-28 07:47:28] [INFO ] Flatten gal took : 5 ms
[2024-05-28 07:47:28] [INFO ] Time to serialize gal into /tmp/LTL10173752393760163854.gal : 1 ms
[2024-05-28 07:47:28] [INFO ] Time to serialize properties into /tmp/LTL3405640205509604170.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10173752393760163854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3405640205509604170.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p54==0)||(p223==1))"))))
Formula 0 simplified : GF!"((p54==0)||(p223==1))"
Detected timeout of ITS tools.
[2024-05-28 07:47:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 07:47:43] [INFO ] Applying decomposition
[2024-05-28 07:47:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8036148575553266456.txt' '-o' '/tmp/graph8036148575553266456.bin' '-w' '/tmp/graph8036148575553266456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8036148575553266456.bin' '-l' '-1' '-v' '-w' '/tmp/graph8036148575553266456.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:47:43] [INFO ] Decomposing Gal with order
[2024-05-28 07:47:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:47:43] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-28 07:47:43] [INFO ] Flatten gal took : 10 ms
[2024-05-28 07:47:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 3 ms.
[2024-05-28 07:47:43] [INFO ] Time to serialize gal into /tmp/LTL15780869394997275806.gal : 2 ms
[2024-05-28 07:47:43] [INFO ] Time to serialize properties into /tmp/LTL16269740740369723823.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15780869394997275806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16269740740369723823.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i1.u9.p54==0)||(i5.u36.p223==1))"))))
Formula 0 simplified : GF!"((i1.u9.p54==0)||(i5.u36.p223==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-12 finished in 108062 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))'
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 214 transition count 210
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 214 transition count 210
Applied a total of 14 rules in 9 ms. Remains 214 /221 variables (removed 7) and now considering 210/217 (removed 7) transitions.
// Phase 1: matrix 210 rows 214 cols
[2024-05-28 07:47:58] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 07:47:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 07:47:58] [INFO ] Invariant cache hit.
[2024-05-28 07:47:58] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-28 07:47:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:00] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:48:00] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:48:00] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:48:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:48:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:48:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:48:00] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:48:00] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:48:01] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:48:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:48:03] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:48:03] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:48:03] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:48:03] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:48:03] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:48:03] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:04] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:48:04] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:48:04] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:48:04] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:48:04] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:48:04] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:48:05] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:48:05] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:48:05] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:48:05] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:48:05] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:48:05] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:48:05] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:05] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:48:06] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:48:06] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:48:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:48:06] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:48:06] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:48:06] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:48:06] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:07] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:08] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:48:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:48:08] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:48:09] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:09] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:48:10] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:48:10] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:12] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:48:12] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:48:12] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:48:12] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:48:12] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:48:12] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:48:13] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:48:13] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:48:13] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:48:13] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:48:13] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:48:13] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2024-05-28 07:48:13] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:48:13] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:48:13] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:48:13] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:48:14] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:48:15] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:48:15] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:48:15] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:17] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2024-05-28 07:48:17] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:48:17] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:48:17] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:48:17] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:48:18] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:48:19] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:48:19] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:19] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:48:19] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:48:20] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:48:20] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:48:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:48:20] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:48:20] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-05-28 07:48:20] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:48:20] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:48:20] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-05-28 07:48:20] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:48:20] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:21] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:48:22] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:48:22] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:25] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:48:25] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:25] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:48:26] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:48:26] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:48:26] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2024-05-28 07:48:26] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:48:26] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:27] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:48:27] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:48:27] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:48:28] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-28 07:48:28] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:48:28] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 4 ms to minimize.
[2024-05-28 07:48:28] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:32] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:48:33] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-28 07:48:33] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:48:33] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:48:34] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:48:34] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:48:34] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:48:34] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:48:34] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:39] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:48:39] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:48:39] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:48:39] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:48:40] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:48:40] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:48:40] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:48:40] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:48:41] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:48:41] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:46] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:48:47] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:48:47] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:48:48] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:48:54] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:48:55] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:48:55] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:48:56] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:48:56] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:48:56] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:48:56] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:48:56] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 8/631 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 214/221 places, 210/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60289 ms. Remains : 214/221 places, 210/217 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/214 stabilizing places and 47/210 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-13 finished in 60660 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(X((X(p0) U p0))))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 214 transition count 210
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 214 transition count 210
Applied a total of 14 rules in 6 ms. Remains 214 /221 variables (removed 7) and now considering 210/217 (removed 7) transitions.
[2024-05-28 07:48:59] [INFO ] Invariant cache hit.
[2024-05-28 07:48:59] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 07:48:59] [INFO ] Invariant cache hit.
[2024-05-28 07:48:59] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-28 07:48:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:49:01] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:49:02] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:49:02] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:49:02] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:49:02] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:49:02] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:49:02] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:49:02] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:02] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:49:02] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:49:02] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:49:03] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:04] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:49:05] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:49:06] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:06] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-28 07:49:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:49:06] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:49:07] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:49:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:49:07] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:49:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:49:07] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:08] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:09] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:49:09] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:49:09] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:49:10] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:10] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:49:10] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:49:11] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:13] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:49:13] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:49:13] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:49:13] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:49:13] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:49:13] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:49:14] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:49:14] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:49:14] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:49:14] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:49:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:49:14] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:49:14] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:49:14] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:49:14] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:49:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:49:15] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:15] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:49:16] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:49:16] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:49:16] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:49:18] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:49:19] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:49:19] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:49:19] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:49:19] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:49:19] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:49:19] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:49:19] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:49:19] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:49:19] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:19] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:49:20] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:49:20] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:49:20] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:49:20] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:49:20] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:49:20] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:49:20] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:49:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:49:20] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:49:20] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:49:21] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:22] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:49:22] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:49:23] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:25] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:49:25] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:25] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:49:26] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:49:26] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:49:26] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:49:26] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:49:27] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:28] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:49:28] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:49:28] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:49:28] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:49:28] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:49:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:49:29] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:33] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:49:33] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-28 07:49:34] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:49:34] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:49:34] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:49:34] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:49:35] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-05-28 07:49:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:49:35] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:40] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:49:40] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:49:40] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-28 07:49:40] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:49:40] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:49:40] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:49:41] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:49:41] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:49:41] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:49:42] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:47] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:49:48] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:49:48] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:49:48] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:49:55] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:49:56] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-05-28 07:49:56] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-05-28 07:49:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:49:57] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:49:57] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:49:57] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:49:57] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 214/221 places, 210/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60257 ms. Remains : 214/221 places, 210/217 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-15 finished in 60413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-28 07:50:00] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5140308468917919160
[2024-05-28 07:50:00] [INFO ] Computing symmetric may disable matrix : 217 transitions.
[2024-05-28 07:50:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:50:00] [INFO ] Computing symmetric may enable matrix : 217 transitions.
[2024-05-28 07:50:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:50:00] [INFO ] Computing Do-Not-Accords matrix : 217 transitions.
[2024-05-28 07:50:00] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:50:00] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5140308468917919160
Running compilation step : cd /tmp/ltsmin5140308468917919160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 07:50:00] [INFO ] Applying decomposition
[2024-05-28 07:50:00] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12617934700520398834.txt' '-o' '/tmp/graph12617934700520398834.bin' '-w' '/tmp/graph12617934700520398834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12617934700520398834.bin' '-l' '-1' '-v' '-w' '/tmp/graph12617934700520398834.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:50:00] [INFO ] Decomposing Gal with order
[2024-05-28 07:50:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:50:00] [INFO ] Removed a total of 92 redundant transitions.
[2024-05-28 07:50:00] [INFO ] Flatten gal took : 31 ms
[2024-05-28 07:50:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 07:50:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality12045578856765995761.gal : 17 ms
[2024-05-28 07:50:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality9744322103340517004.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12045578856765995761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9744322103340517004.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F("((i1.i0.u13.p31==0)||(i0.i2.u9.p21==1))"))))
Formula 0 simplified : FG!"((i1.i0.u13.p31==0)||(i0.i2.u9.p21==1))"
Compilation finished in 637 ms.
Running link step : cd /tmp/ltsmin5140308468917919160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin5140308468917919160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5140308468917919160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5140308468917919160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 08:14:04] [INFO ] Applying decomposition
[2024-05-28 08:14:04] [INFO ] Flatten gal took : 20 ms
[2024-05-28 08:14:04] [INFO ] Decomposing Gal with order
[2024-05-28 08:14:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:14:04] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-28 08:14:04] [INFO ] Flatten gal took : 54 ms
[2024-05-28 08:14:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 32 ms.
[2024-05-28 08:14:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality6419050131272074806.gal : 11 ms
[2024-05-28 08:14:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality15891626230589530031.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6419050131272074806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15891626230589530031.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F("((i0.i0.i0.i1.i0.i0.i0.u18.p31==0)||(i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u14.p21==1))"))))
Formula 0 simplified : FG!"((i0.i0.i0.i1.i0.i0.i0.u18.p31==0)||(i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u14.p21==1))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5140308468917919160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5140308468917919160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-28 08:32:53] [INFO ] Flatten gal took : 43 ms
[2024-05-28 08:32:53] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-28 08:32:53] [INFO ] Transformed 221 places.
[2024-05-28 08:32:53] [INFO ] Transformed 217 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 08:32:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality10220523885137484870.gal : 2 ms
[2024-05-28 08:32:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality16538896232007963281.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10220523885137484870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16538896232007963281.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p31==0)||(p21==1))"))))
Formula 0 simplified : FG!"((p31==0)||(p21==1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Initializing POR dependencies: labels 219, guards 217
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.276: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 0.276: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.276: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.461: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.474: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.490: There are 221 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.490: State length is 222, there are 220 groups
pins2lts-mc-linux64( 0/ 8), 0.490: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.490: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.490: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.490: Visible groups: 0 / 220, labels: 1 / 221
pins2lts-mc-linux64( 0/ 8), 0.490: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.490: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.502: [Blue] ~113 levels ~960 states ~1144 transitions
pins2lts-mc-linux64( 5/ 8), 0.525: [Blue] ~223 levels ~1920 states ~2920 transitions
pins2lts-mc-linux64( 5/ 8), 0.565: [Blue] ~438 levels ~3840 states ~6088 transitions
pins2lts-mc-linux64( 5/ 8), 0.617: [Blue] ~672 levels ~7680 states ~11264 transitions
pins2lts-mc-linux64( 5/ 8), 0.708: [Blue] ~672 levels ~15360 states ~20384 transitions
pins2lts-mc-linux64( 6/ 8), 0.897: [Blue] ~560 levels ~30720 states ~40208 transitions
pins2lts-mc-linux64( 6/ 8), 1.289: [Blue] ~560 levels ~61440 states ~77816 transitions
pins2lts-mc-linux64( 5/ 8), 1.985: [Blue] ~694 levels ~122880 states ~150456 transitions
pins2lts-mc-linux64( 5/ 8), 3.169: [Blue] ~694 levels ~245760 states ~300968 transitions
pins2lts-mc-linux64( 5/ 8), 5.243: [Blue] ~694 levels ~491520 states ~603360 transitions
pins2lts-mc-linux64( 4/ 8), 8.878: [Blue] ~449 levels ~983040 states ~1263336 transitions
pins2lts-mc-linux64( 5/ 8), 15.683: [Blue] ~694 levels ~1966080 states ~2456832 transitions
pins2lts-mc-linux64( 5/ 8), 29.032: [Blue] ~694 levels ~3932160 states ~4895136 transitions
pins2lts-mc-linux64( 5/ 8), 55.529: [Blue] ~694 levels ~7864320 states ~9831184 transitions
pins2lts-mc-linux64( 3/ 8), 108.570: [Blue] ~667 levels ~15728640 states ~20069952 transitions
pins2lts-mc-linux64( 4/ 8), 214.415: [Blue] ~504 levels ~31457280 states ~40575776 transitions
pins2lts-mc-linux64( 5/ 8), 431.076: [Blue] ~700 levels ~62914560 states ~80244944 transitions
pins2lts-mc-linux64( 5/ 8), 877.557: [Blue] ~704 levels ~125829120 states ~161341064 transitions
pins2lts-mc-linux64( 3/ 8), 970.216: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 970.277:
pins2lts-mc-linux64( 0/ 8), 970.277: Explored 134214850 states 176364063 transitions, fanout: 1.314
pins2lts-mc-linux64( 0/ 8), 970.277: Total exploration time 969.740 sec (969.700 sec minimum, 969.724 sec on average)
pins2lts-mc-linux64( 0/ 8), 970.277: States per second: 138403, Transitions per second: 181867
pins2lts-mc-linux64( 0/ 8), 970.277:
pins2lts-mc-linux64( 0/ 8), 970.277: State space has 134217316 states, 134210970 are accepting
pins2lts-mc-linux64( 0/ 8), 970.277: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 970.277: blue states: 134214850 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 970.277: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 970.277: all-red states: 134210970 (100.00%), bogus 53 (0.00%)
pins2lts-mc-linux64( 0/ 8), 970.277:
pins2lts-mc-linux64( 0/ 8), 970.277: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 970.277:
pins2lts-mc-linux64( 0/ 8), 970.277: Queue width: 8B, total height: 4738, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 970.277: Tree memory: 1028.7MB, 8.0 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 970.277: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 970.277: Stored 218 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 970.277: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 970.277: Est. total memory use: 1028.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5140308468917919160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5140308468917919160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-004B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-004B.tgz
mv ShieldIIPs-PT-004B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;