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-171683760300075.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-005B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760300075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 82K 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-005B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-005B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716887497135

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-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 09:11:38] [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 09:11:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:11:38] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-28 09:11:38] [INFO ] Transformed 303 places.
[2024-05-28 09:11:38] [INFO ] Transformed 298 transitions.
[2024-05-28 09:11:38] [INFO ] Found NUPN structural information;
[2024-05-28 09:11:38] [INFO ] Parsed PT model containing 303 places and 298 transitions and 896 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-005B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 298/298 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 275 transition count 270
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 275 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 274 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 274 transition count 269
Applied a total of 58 rules in 64 ms. Remains 274 /303 variables (removed 29) and now considering 269/298 (removed 29) transitions.
// Phase 1: matrix 269 rows 274 cols
[2024-05-28 09:11:38] [INFO ] Computed 46 invariants in 20 ms
[2024-05-28 09:11:39] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-28 09:11:39] [INFO ] Invariant cache hit.
[2024-05-28 09:11:39] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-28 09:11:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 10 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 3 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:11:42] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:11:43] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-05-28 09:11:43] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:11:43] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:11:43] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:11:43] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 09:11:43] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-28 09:11:43] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:11:43] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:11:44] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:11:45] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-28 09:11:45] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-28 09:11:45] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 5 ms to minimize.
[2024-05-28 09:11:45] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:11:45] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:11:45] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:11:45] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-28 09:11:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:11:47] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:11:47] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:11:47] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-28 09:11:47] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-28 09:11:47] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-28 09:11:47] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 5 ms to minimize.
[2024-05-28 09:11:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:11:47] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:11:47] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:11:47] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-28 09:11:48] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:11:48] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:11:48] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:11:48] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:11:48] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:11:48] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:11:48] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:11:48] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:11:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:11:48] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:11:49] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:11:49] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:11:49] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:11:49] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:11:49] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:11:49] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:11:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:11:50] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:11:51] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-28 09:11:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:11:51] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:11:51] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:11:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:11:52] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:11:52] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:11:52] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:11:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:11:54] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:11:54] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:11:55] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:11:55] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:11:55] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:11:55] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 7/142 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:11:56] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-28 09:11:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 269/543 variables, 274/418 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:00] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:12:00] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:12:01] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:12:01] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:12:01] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:12:01] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:12:01] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:12:02] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:03] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:12:03] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:12:03] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:12:03] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:12:03] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:12:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:12:04] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:12:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:12:04] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:12:04] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:12:04] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:12:04] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:12:04] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:12:04] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:12:04] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:12:04] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2024-05-28 09:12:05] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:12:05] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:12:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:12:05] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 20/458 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:07] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:12:07] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:12:08] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:12:08] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:12:08] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:12:08] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:12:08] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:12:08] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:12:08] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:12:08] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:12:09] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:12:09] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:12:09] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 471 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 151/151 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 151/197 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:11] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:12:11] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:12:11] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-28 09:12:11] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-28 09:12:11] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:12:12] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:12:12] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:12:12] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:12:12] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:12:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:12:12] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:12:12] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:12:12] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:12:12] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/211 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:14] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:12:14] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:12:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:12:14] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:15] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:12:16] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:12:16] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:12:16] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:12:16] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 5/220 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:17] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:12:17] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:12:18] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:12:18] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:19] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:12:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:12:19] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:12:19] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:12:19] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:12:19] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:12:20] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:22] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-28 09:12:22] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:12:22] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:12:22] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-05-28 09:12:22] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:12:22] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:23] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 09:12:23] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:12:23] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:12:24] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 269/543 variables, 274/528 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 268/796 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-28 09:12:30] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:12:32] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-28 09:12:32] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:12:32] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:12:34] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:12:34] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:12:34] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:12:34] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:12:34] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:12:34] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:12:34] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:12:35] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 20/816 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 816 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 228/228 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 274/303 places, 269/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60781 ms. Remains : 274/303 places, 269/298 transitions.
Support contains 33 out of 274 places after structural reductions.
[2024-05-28 09:12:39] [INFO ] Flatten gal took : 44 ms
[2024-05-28 09:12:39] [INFO ] Flatten gal took : 19 ms
[2024-05-28 09:12:39] [INFO ] Input system was already deterministic with 269 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 20117 steps (28 resets) in 556 ms. (36 steps per ms) remains 0/23 properties
FORMULA ShieldIIPs-PT-005B-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 62 stabilizing places and 62 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' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 273 transition count 242
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 247 transition count 242
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 52 place count 247 transition count 218
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 223 transition count 218
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 106 place count 217 transition count 212
Iterating global reduction 2 with 6 rules applied. Total rules applied 112 place count 217 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 112 place count 217 transition count 211
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 216 transition count 211
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 280 place count 133 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 282 place count 131 transition count 126
Applied a total of 282 rules in 62 ms. Remains 131 /274 variables (removed 143) and now considering 126/269 (removed 143) transitions.
// Phase 1: matrix 126 rows 131 cols
[2024-05-28 09:12:40] [INFO ] Computed 46 invariants in 5 ms
[2024-05-28 09:12:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 09:12:40] [INFO ] Invariant cache hit.
[2024-05-28 09:12:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 09:12:40] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-28 09:12:40] [INFO ] Redundant transitions in 24 ms returned [125]
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 122 sub problems to find dead transitions.
// Phase 1: matrix 125 rows 131 cols
[2024-05-28 09:12:40] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:12:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:40] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:12:41] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:12:41] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:12:41] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:12:41] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:12:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:12:41] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:12:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 3/131 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:12:42] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:12:42] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:12:42] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:12:42] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:12:42] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:12:42] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:12:42] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-28 09:12:42] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:12:42] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:12:43] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:12:43] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
[2024-05-28 09:12:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:12:43] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:12:43] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:43] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:12:43] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:12:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 125/256 variables, 131/204 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:44] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 11 ms to minimize.
[2024-05-28 09:12:45] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/256 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:45] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:12:45] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:12:45] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:12:45] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:12:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:12:46] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:46] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:12:46] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:12:46] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 09:12:46] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:12:47] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:48] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/256 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:49] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:12:49] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/256 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 19 (OVERLAPS) 0/256 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 224 constraints, problems are : Problem set: 0 solved, 122 unsolved in 10356 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 131/131 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 31/60 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 3/131 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:51] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:51] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:12:51] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:12:51] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 125/256 variables, 131/225 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 122/350 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:12:53] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:12:53] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:12:53] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/256 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 353 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7729 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 131/131 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 51/51 constraints]
After SMT, in 18109ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 18111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/274 places, 125/269 transitions.
Applied a total of 0 rules in 10 ms. Remains 131 /131 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18427 ms. Remains : 131/274 places, 125/269 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-02
Stuttering criterion allowed to conclude after 303 steps with 0 reset in 6 ms.
FORMULA ShieldIIPs-PT-005B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-02 finished in 18695 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 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 273 transition count 242
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 247 transition count 242
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 247 transition count 216
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 221 transition count 216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 110 place count 215 transition count 210
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 215 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 116 place count 215 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 214 transition count 209
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 290 place count 128 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 126 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 125 transition count 121
Applied a total of 293 rules in 30 ms. Remains 125 /274 variables (removed 149) and now considering 121/269 (removed 148) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 09:12:58] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:12:59] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-28 09:12:59] [INFO ] Invariant cache hit.
[2024-05-28 09:12:59] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-28 09:12:59] [INFO ] Redundant transitions in 23 ms returned [120]
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 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 09:12:59] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:12:59] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:12:59] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:12:59] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:12:59] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:12:59] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:12:59] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:12:59] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:12:59] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:13:00] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/245 variables, 125/190 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:13:01] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:13:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:13:01] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:13:01] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:13:02] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:13:02] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 196 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5249 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/245 variables, 125/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 119/315 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:13:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:13:05] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:13:05] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:13:05] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:13:05] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:13:07] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:13:08] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:13:08] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 323 constraints, problems are : Problem set: 0 solved, 119 unsolved in 8064 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 34/34 constraints]
After SMT, in 13336ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13339ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/274 places, 120/269 transitions.
Applied a total of 0 rules in 12 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13577 ms. Remains : 125/274 places, 120/269 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-03
Stuttering criterion allowed to conclude after 261 steps with 0 reset in 6 ms.
FORMULA ShieldIIPs-PT-005B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-03 finished in 13633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U ((!p1&&X(F(!p1))&&F(p2))||G(!p1))))'
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 269 transition count 264
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 269 transition count 264
Applied a total of 10 rules in 6 ms. Remains 269 /274 variables (removed 5) and now considering 264/269 (removed 5) transitions.
// Phase 1: matrix 264 rows 269 cols
[2024-05-28 09:13:12] [INFO ] Computed 46 invariants in 3 ms
[2024-05-28 09:13:12] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 09:13:12] [INFO ] Invariant cache hit.
[2024-05-28 09:13:12] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-28 09:13:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:15] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:13:15] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:13:15] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:13:15] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:13:15] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:13:15] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:13:15] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-28 09:13:15] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:15] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:13:15] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:13:16] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:13:16] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:16] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:13:16] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:13:16] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-28 09:13:16] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 09:13:16] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-28 09:13:16] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-28 09:13:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:13:16] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:13:21] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:13:21] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:13:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:21] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:13:21] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:13:23] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:13:23] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:13:23] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:23] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:13:27] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:28] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 264/533 variables, 269/420 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:32] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:13:32] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:13:32] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:13:33] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:13:33] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:13:33] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:34] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:34] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:34] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:13:34] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:34] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:13:34] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-05-28 09:13:34] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:13:34] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:13:34] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:13:35] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:13:35] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:13:35] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:13:35] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:35] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/533 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:35] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:13:36] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2024-05-28 09:13:36] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:13:37] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:37] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:13:37] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:13:37] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/533 variables, 7/447 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:40] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:13:40] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:13:40] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/533 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:41] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:13:41] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:41] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:41] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/533 variables, and 465 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 150/150 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 150/196 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:44] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 09:13:44] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:13:44] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:13:45] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:13:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:13:45] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:13:45] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:13:45] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:46] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:13:47] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:13:47] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:47] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 264/533 variables, 269/477 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 263/740 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:13:52] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:13:52] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-05-28 09:13:52] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-28 09:13:53] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:13:53] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:13:53] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:13:53] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:13:53] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:54] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:13:55] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:13:55] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:13:55] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:13:55] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-28 09:13:55] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:13:55] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 20/760 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-28 09:14:02] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-28 09:14:03] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:14:03] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:14:04] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:14:04] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:14:06] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:14:07] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-28 09:14:10] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 18/778 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/533 variables, and 778 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 200/200 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 269/274 places, 264/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60356 ms. Remains : 269/274 places, 264/269 transitions.
Stuttering acceptance computed with spot in 268 ms :[p1, p1, (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 29 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-04 finished in 61275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U X(X(p0))))||F(p1)||G(p2)))'
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 267 transition count 262
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 267 transition count 262
Applied a total of 14 rules in 9 ms. Remains 267 /274 variables (removed 7) and now considering 262/269 (removed 7) transitions.
// Phase 1: matrix 262 rows 267 cols
[2024-05-28 09:14:13] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:14:13] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 09:14:13] [INFO ] Invariant cache hit.
[2024-05-28 09:14:14] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-28 09:14:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:16] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:14:16] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:16] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:16] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-28 09:14:16] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:14:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-05-28 09:14:22] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:14:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:14:26] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:28] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:14:28] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:30] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:14:30] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:14:30] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:31] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 262/529 variables, 267/396 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:35] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:35] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:14:36] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:36] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:36] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:14:36] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-05-28 09:14:36] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:14:37] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:14:37] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-05-28 09:14:37] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:37] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 11/407 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:39] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:14:39] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:14:42] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 18/425 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:42] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:14:43] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:14:43] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:14:43] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:14:44] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
SMT process timed out in 30096ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 30099ms
Starting structural reductions in LTL mode, iteration 1 : 267/274 places, 262/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30391 ms. Remains : 267/274 places, 262/269 transitions.
Stuttering acceptance computed with spot in 590 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-05
Product exploration explored 100000 steps with 25000 reset in 109 ms.
Product exploration explored 100000 steps with 25000 reset in 114 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 98 ms. Reduced automaton from 15 states, 29 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 828 steps (0 resets) in 25 ms. (31 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 21 factoid took 193 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 267 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Applied a total of 0 rules in 2 ms. Remains 267 /267 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-28 09:14:46] [INFO ] Invariant cache hit.
[2024-05-28 09:14:46] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 09:14:46] [INFO ] Invariant cache hit.
[2024-05-28 09:14:46] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-28 09:14:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:48] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:14:48] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:14:48] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:53] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:14:53] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:14:53] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:14:53] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:53] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:14:53] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:14:54] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:58] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:14:58] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:15:00] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:15:00] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:15:02] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:15:02] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:15:02] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:15:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 262/529 variables, 267/396 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:15:07] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:15:07] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:15:08] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:15:08] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:15:08] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:15:08] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:15:08] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:15:09] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:15:09] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:15:09] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:15:09] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 11/407 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:15:11] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:15:12] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:15:12] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:15:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:15:12] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:15:12] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:15:12] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:15:12] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:15:12] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:15:13] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:15:13] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:15:13] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:15:13] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:15:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:15:13] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:15:13] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:15:13] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:15:14] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 18/425 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:15:14] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:15:15] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:15:15] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-28 09:15:16] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:15:16] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:15:16] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-28 09:15:16] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
SMT process timed out in 30049ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 30053ms
Finished structural reductions in LTL mode , in 1 iterations and 30337 ms. Remains : 267/267 places, 262/262 transitions.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1309 steps (0 resets) in 28 ms. (45 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Product exploration explored 100000 steps with 25000 reset in 115 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 267 transition count 262
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 25 place count 267 transition count 264
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 35 place count 267 transition count 264
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 1 with 103 rules applied. Total rules applied 138 place count 267 transition count 264
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 174 place count 231 transition count 228
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 210 place count 231 transition count 228
Deduced a syphon composed of 102 places in 0 ms
Applied a total of 210 rules in 34 ms. Remains 231 /267 variables (removed 36) and now considering 228/262 (removed 34) transitions.
[2024-05-28 09:15:18] [INFO ] Redundant transitions in 74 ms returned [227]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 226 sub problems to find dead transitions.
// Phase 1: matrix 227 rows 231 cols
[2024-05-28 09:15:18] [INFO ] Computed 46 invariants in 10 ms
[2024-05-28 09:15:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 20/66 constraints. Problems are: Problem set: 69 solved, 157 unsolved
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD175 is UNSAT
[2024-05-28 09:15:22] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 20/86 constraints. Problems are: Problem set: 102 solved, 124 unsolved
[2024-05-28 09:15:23] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
Problem TDEAD195 is UNSAT
[2024-05-28 09:15:23] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 2/88 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/88 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 227/458 variables, 231/319 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 3/322 constraints. Problems are: Problem set: 104 solved, 122 unsolved
[2024-05-28 09:15:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 1/323 constraints. Problems are: Problem set: 104 solved, 122 unsolved
[2024-05-28 09:15:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:15:25] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 2/325 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/325 constraints. Problems are: Problem set: 104 solved, 122 unsolved
[2024-05-28 09:15:27] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/458 variables, 1/326 constraints. Problems are: Problem set: 104 solved, 122 unsolved
[2024-05-28 09:15:29] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 1/327 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/327 constraints. Problems are: Problem set: 104 solved, 122 unsolved
[2024-05-28 09:15:30] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/458 variables, 1/328 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/328 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 16 (OVERLAPS) 0/458 variables, 0/328 constraints. Problems are: Problem set: 104 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 328 constraints, problems are : Problem set: 104 solved, 122 unsolved in 15200 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 231/231 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 104 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 103/231 variables, 46/46 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 48/94 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/94 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 227/458 variables, 231/325 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 3/328 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 122/450 constraints. Problems are: Problem set: 104 solved, 122 unsolved
[2024-05-28 09:15:35] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:15:35] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:15:36] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:15:36] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:15:36] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 5/455 constraints. Problems are: Problem set: 104 solved, 122 unsolved
[2024-05-28 09:15:39] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 1/456 constraints. Problems are: Problem set: 104 solved, 122 unsolved
[2024-05-28 09:15:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/457 constraints. Problems are: Problem set: 104 solved, 122 unsolved
[2024-05-28 09:15:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 1/458 constraints. Problems are: Problem set: 104 solved, 122 unsolved
[2024-05-28 09:15:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:15:51] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 2/460 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/460 constraints. Problems are: Problem set: 104 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/460 constraints. Problems are: Problem set: 104 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 460 constraints, problems are : Problem set: 104 solved, 122 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 231/231 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 122/226 constraints, Known Traps: 58/58 constraints]
After SMT, in 45262ms problems are : Problem set: 104 solved, 122 unsolved
Search for dead transitions found 104 dead transitions in 45264ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 231/267 places, 123/262 transitions.
Graph (complete) has 444 edges and 231 vertex of which 129 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.2 ms
Discarding 102 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 129 /231 variables (removed 102) and now considering 123/123 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/267 places, 123/262 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45390 ms. Remains : 129/267 places, 123/262 transitions.
Built C files in :
/tmp/ltsmin14597352486926812773
[2024-05-28 09:16:03] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14597352486926812773
Running compilation step : cd /tmp/ltsmin14597352486926812773;'/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 577 ms.
Running link step : cd /tmp/ltsmin14597352486926812773;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14597352486926812773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13680907123065008289.hoa' '--buchi-type=spotba'
LTSmin run took 521 ms.
FORMULA ShieldIIPs-PT-005B-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-05 finished in 110881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((G(p1) U G(!p2))))))'
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 270 transition count 265
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 270 transition count 265
Applied a total of 8 rules in 15 ms. Remains 270 /274 variables (removed 4) and now considering 265/269 (removed 4) transitions.
// Phase 1: matrix 265 rows 270 cols
[2024-05-28 09:16:04] [INFO ] Computed 46 invariants in 2 ms
[2024-05-28 09:16:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 09:16:04] [INFO ] Invariant cache hit.
[2024-05-28 09:16:05] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-05-28 09:16:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:07] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:16:07] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:16:07] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:16:07] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
[2024-05-28 09:16:07] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-28 09:16:07] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-28 09:16:07] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:16:08] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:16:10] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:16:10] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:16:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:16:10] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:16:10] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:16:10] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:16:10] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:16:10] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:16:10] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
[2024-05-28 09:16:16] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:16:16] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:18] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:16:18] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:22] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 265/535 variables, 270/410 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:25] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:16:25] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:25] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:16:25] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 20/430 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:31] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:31] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:16:31] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:31] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:16:31] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:16:31] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:16:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:16:31] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:16:31] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:32] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:16:32] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:16:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:16:32] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:32] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:16:33] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:16:33] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:33] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:16:33] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-28 09:16:33] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:16:33] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:33] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:35] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:16:35] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:16:35] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
SMT process timed out in 30073ms, After SMT, problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 30076ms
Starting structural reductions in LTL mode, iteration 1 : 270/274 places, 265/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30372 ms. Remains : 270/274 places, 265/269 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-06
Product exploration explored 100000 steps with 19940 reset in 115 ms.
Product exploration explored 100000 steps with 20018 reset in 167 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/270 stabilizing places and 62/265 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 193 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 1675 steps (1 resets) in 31 ms. (52 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F p0), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 18 factoid took 577 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2) (NOT p1))]
[2024-05-28 09:16:37] [INFO ] Invariant cache hit.
[2024-05-28 09:16:37] [INFO ] [Real]Absence check using 46 positive place invariants in 11 ms returned sat
[2024-05-28 09:16:37] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-28 09:16:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:16:37] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2024-05-28 09:16:37] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-05-28 09:16:37] [INFO ] Computed and/alt/rep : 264/590/264 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-28 09:16:39] [INFO ] Added : 235 causal constraints over 48 iterations in 1750 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 265/265 transitions.
Applied a total of 0 rules in 7 ms. Remains 270 /270 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-05-28 09:16:39] [INFO ] Invariant cache hit.
[2024-05-28 09:16:39] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 09:16:39] [INFO ] Invariant cache hit.
[2024-05-28 09:16:39] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-05-28 09:16:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:16:43] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-28 09:16:43] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:16:43] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:16:43] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-28 09:16:43] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:16:43] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:16:43] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:16:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:16:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:44] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:16:45] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:16:45] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:16:45] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:16:45] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:45] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:16:45] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:46] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:16:47] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:16:48] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:48] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:48] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:16:48] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:48] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:16:48] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:49] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:16:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:16:50] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:50] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:16:50] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:16:51] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:16:51] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:53] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:16:53] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:55] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:16:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:55] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:16:55] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:16:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:16:55] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:16:55] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:16:57] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 265/535 variables, 270/410 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:17:00] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:17:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:17:00] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:17:01] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:17:01] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:17:01] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:17:01] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:17:01] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:17:01] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-28 09:17:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:17:01] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:17:01] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:17:01] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:17:02] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:17:02] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:17:02] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:17:02] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:17:02] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:17:02] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:17:02] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 20/430 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:17:06] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:17:06] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:17:06] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:17:06] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:17:07] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:17:07] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:17:07] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:17:07] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:17:07] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:17:07] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:17:07] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:17:07] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:17:07] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:17:08] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:17:08] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:17:08] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:17:08] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:17:08] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:17:08] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:17:08] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:17:08] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:17:09] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:17:09] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:17:09] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
SMT process timed out in 30070ms, After SMT, problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 30074ms
Finished structural reductions in LTL mode , in 1 iterations and 30374 ms. Remains : 270/270 places, 265/265 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/270 stabilizing places and 62/265 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 162 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 1261 steps (0 resets) in 15 ms. (78 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F p0), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 18 factoid took 564 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2) (NOT p1))]
[2024-05-28 09:17:11] [INFO ] Invariant cache hit.
[2024-05-28 09:17:11] [INFO ] [Real]Absence check using 46 positive place invariants in 12 ms returned sat
[2024-05-28 09:17:11] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-28 09:17:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:17:11] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2024-05-28 09:17:11] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-05-28 09:17:11] [INFO ] Computed and/alt/rep : 264/590/264 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-28 09:17:13] [INFO ] Added : 235 causal constraints over 48 iterations in 1708 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 19925 reset in 123 ms.
Product exploration explored 100000 steps with 20001 reset in 132 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 265/265 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 270 transition count 265
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 24 place count 270 transition count 269
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 35 place count 270 transition count 269
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 1 with 103 rules applied. Total rules applied 138 place count 270 transition count 269
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 173 place count 235 transition count 234
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 208 place count 235 transition count 234
Deduced a syphon composed of 103 places in 0 ms
Applied a total of 208 rules in 40 ms. Remains 235 /270 variables (removed 35) and now considering 234/265 (removed 31) transitions.
[2024-05-28 09:17:14] [INFO ] Redundant transitions in 31 ms returned [233]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 232 sub problems to find dead transitions.
// Phase 1: matrix 233 rows 235 cols
[2024-05-28 09:17:14] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:17:14] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/66 constraints. Problems are: Problem set: 69 solved, 163 unsolved
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/86 constraints. Problems are: Problem set: 89 solved, 143 unsolved
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 19/105 constraints. Problems are: Problem set: 107 solved, 125 unsolved
[2024-05-28 09:17:20] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/106 constraints. Problems are: Problem set: 107 solved, 125 unsolved
[2024-05-28 09:17:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:17:21] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:17:21] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:17:21] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 4/110 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/110 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 233/468 variables, 235/345 constraints. Problems are: Problem set: 107 solved, 125 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 3/348 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/348 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/468 variables, 0/348 constraints. Problems are: Problem set: 107 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 348 constraints, problems are : Problem set: 107 solved, 125 unsolved in 9654 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 235/235 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 107 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 104/235 variables, 46/46 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 64/110 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/110 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 233/468 variables, 235/345 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 3/348 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 125/473 constraints. Problems are: Problem set: 107 solved, 125 unsolved
[2024-05-28 09:17:26] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:17:27] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:17:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:17:27] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:17:27] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:17:27] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:17:28] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:17:28] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:17:28] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:17:28] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:17:28] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:17:28] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:17:28] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:17:28] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 14/487 constraints. Problems are: Problem set: 107 solved, 125 unsolved
[2024-05-28 09:17:30] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:17:30] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:17:31] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:17:31] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:17:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:17:32] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:17:32] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 7/494 constraints. Problems are: Problem set: 107 solved, 125 unsolved
[2024-05-28 09:17:34] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:17:35] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 2/496 constraints. Problems are: Problem set: 107 solved, 125 unsolved
[2024-05-28 09:17:39] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:17:41] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:17:41] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 3/499 constraints. Problems are: Problem set: 107 solved, 125 unsolved
[2024-05-28 09:17:45] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-28 09:17:47] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 2/501 constraints. Problems are: Problem set: 107 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/501 constraints. Problems are: Problem set: 107 solved, 125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 501 constraints, problems are : Problem set: 107 solved, 125 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 235/235 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 125/232 constraints, Known Traps: 92/92 constraints]
After SMT, in 39707ms problems are : Problem set: 107 solved, 125 unsolved
Search for dead transitions found 107 dead transitions in 39710ms
Found 107 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 107 transitions
Dead transitions reduction (with SMT) removed 107 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 235/270 places, 126/265 transitions.
Graph (complete) has 445 edges and 235 vertex of which 132 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.2 ms
Discarding 103 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 132 /235 variables (removed 103) and now considering 126/126 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 132/270 places, 126/265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39796 ms. Remains : 132/270 places, 126/265 transitions.
Built C files in :
/tmp/ltsmin16397662974354948171
[2024-05-28 09:17:54] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16397662974354948171
Running compilation step : cd /tmp/ltsmin16397662974354948171;'/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 483 ms.
Running link step : cd /tmp/ltsmin16397662974354948171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16397662974354948171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15413544645897738287.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 265/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 270 /270 variables (removed 0) and now considering 265/265 (removed 0) transitions.
// Phase 1: matrix 265 rows 270 cols
[2024-05-28 09:18:09] [INFO ] Computed 46 invariants in 5 ms
[2024-05-28 09:18:09] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 09:18:09] [INFO ] Invariant cache hit.
[2024-05-28 09:18:09] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-05-28 09:18:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:18:13] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:18:13] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:18:13] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:18:13] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:18:13] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:18:13] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:18:13] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:18:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:18:13] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:18:15] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:18:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:18:15] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:18:15] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:18:15] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:18:15] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:16] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:18:17] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:18:18] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:18:18] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:18] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:18:18] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:18:18] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:18:19] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:20] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:18:20] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:18:20] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:18:21] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:23] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:18:23] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:25] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:18:25] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:18:25] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:18:25] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:18:25] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:25] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:18:25] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:27] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 265/535 variables, 270/410 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 20/430 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:18:37] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:18:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:18:37] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-28 09:18:37] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:18:37] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:18:38] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:18:38] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:18:38] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:18:38] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:18:38] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-28 09:18:39] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:18:39] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:18:39] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:18:39] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:18:39] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:18:39] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:18:39] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:18:39] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:18:39] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:18:39] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
SMT process timed out in 30061ms, After SMT, problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 30069ms
Finished structural reductions in LTL mode , in 1 iterations and 30369 ms. Remains : 270/270 places, 265/265 transitions.
Built C files in :
/tmp/ltsmin13664168748289277875
[2024-05-28 09:18:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13664168748289277875
Running compilation step : cd /tmp/ltsmin13664168748289277875;'/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 474 ms.
Running link step : cd /tmp/ltsmin13664168748289277875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13664168748289277875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11132035929605504416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:18:55] [INFO ] Flatten gal took : 14 ms
[2024-05-28 09:18:55] [INFO ] Flatten gal took : 13 ms
[2024-05-28 09:18:55] [INFO ] Time to serialize gal into /tmp/LTL1807958578674179203.gal : 4 ms
[2024-05-28 09:18:55] [INFO ] Time to serialize properties into /tmp/LTL9289983755076742353.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/LTL1807958578674179203.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17622878811415672290.hoa' '-atoms' '/tmp/LTL9289983755076742353.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9289983755076742353.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17622878811415672290.hoa
Detected timeout of ITS tools.
[2024-05-28 09:19:10] [INFO ] Flatten gal took : 14 ms
[2024-05-28 09:19:10] [INFO ] Flatten gal took : 12 ms
[2024-05-28 09:19:10] [INFO ] Time to serialize gal into /tmp/LTL14447431692179701172.gal : 3 ms
[2024-05-28 09:19:10] [INFO ] Time to serialize properties into /tmp/LTL14292787825640356246.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14447431692179701172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14292787825640356246.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...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(p101==1)"))||(X((G("((p137==0)||(p42==1))"))U(G(!("((p272==0)||(p92==1))"))))))))
Formula 0 simplified : F(G!"(p101==1)" & X(F!"((p137==0)||(p42==1))" R F"((p272==0)||(p92==1))"))
Detected timeout of ITS tools.
[2024-05-28 09:19:25] [INFO ] Flatten gal took : 12 ms
[2024-05-28 09:19:25] [INFO ] Applying decomposition
[2024-05-28 09:19:25] [INFO ] Flatten gal took : 11 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/graph15947826995139074493.txt' '-o' '/tmp/graph15947826995139074493.bin' '-w' '/tmp/graph15947826995139074493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15947826995139074493.bin' '-l' '-1' '-v' '-w' '/tmp/graph15947826995139074493.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:19:25] [INFO ] Decomposing Gal with order
[2024-05-28 09:19:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:19:25] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-28 09:19:25] [INFO ] Flatten gal took : 49 ms
[2024-05-28 09:19:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 09:19:25] [INFO ] Time to serialize gal into /tmp/LTL5885646673299669818.gal : 5 ms
[2024-05-28 09:19:25] [INFO ] Time to serialize properties into /tmp/LTL15320406178029222926.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/LTL5885646673299669818.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15320406178029222926.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...255
Read 1 LTL properties
Checking formula 0 : !((G((F("(i2.i0.i0.u35.p101==1)"))||(X((G("((i4.u46.p137==0)||(i0.u15.p42==1))"))U(G(!("((i10.u91.p272==0)||(i2.i1.i1.u32.p92==1))")))...160
Formula 0 simplified : F(G!"(i2.i0.i0.u35.p101==1)" & X(F!"((i4.u46.p137==0)||(i0.u15.p42==1))" R F"((i10.u91.p272==0)||(i2.i1.i1.u32.p92==1))"))
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-06 finished in 215733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(p1)))||p0))))'
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 267 transition count 262
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 267 transition count 262
Applied a total of 14 rules in 6 ms. Remains 267 /274 variables (removed 7) and now considering 262/269 (removed 7) transitions.
// Phase 1: matrix 262 rows 267 cols
[2024-05-28 09:19:40] [INFO ] Computed 46 invariants in 2 ms
[2024-05-28 09:19:40] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 09:19:40] [INFO ] Invariant cache hit.
[2024-05-28 09:19:40] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-28 09:19:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:19:44] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-28 09:19:44] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-28 09:19:44] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 3 ms to minimize.
[2024-05-28 09:19:44] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:19:44] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2024-05-28 09:19:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:19:44] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-28 09:19:45] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-28 09:19:46] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:19:46] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:19:46] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-28 09:19:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:19:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:19:47] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:19:48] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:19:49] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:19:49] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:19:49] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:19:49] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:19:49] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:19:49] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:19:49] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:19:50] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:19:50] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:19:50] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:19:50] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:19:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:19:50] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:19:50] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:19:50] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:19:50] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:19:51] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:19:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:19:52] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-28 09:19:52] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:19:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:19:52] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:19:52] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:19:54] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-28 09:19:55] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:19:57] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 262/529 variables, 267/396 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:01] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:20:01] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:20:02] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:20:02] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:20:02] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:20:02] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 11/407 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:06] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:20:06] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:06] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:20:06] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:20:06] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2024-05-28 09:20:06] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:20:06] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 18/425 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:09] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:20:10] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:20:10] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:20:10] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:20:10] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:20:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:20:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/529 variables, and 432 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 119/119 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 119/165 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:14] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:20:14] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:20:14] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:20:14] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:16] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:17] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:20:17] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:20:17] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:20:17] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:20:17] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 5/181 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 262/529 variables, 267/448 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 261/709 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:22] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 09:20:23] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-28 09:20:23] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:20:24] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:20:25] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:20:25] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:20:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:20:25] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:20:25] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:20:25] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 20/729 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:29] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-28 09:20:29] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:20:29] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-28 09:20:30] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:20:30] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:20:30] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:20:30] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:20:30] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:20:30] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:20:30] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:20:31] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-05-28 09:20:31] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:20:31] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:20:31] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:20:32] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:20:32] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:20:32] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 17/746 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 746 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 172/172 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 267/274 places, 262/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60348 ms. Remains : 267/274 places, 262/269 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 89 ms.
Product exploration explored 100000 steps with 33333 reset in 96 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005B-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-07 finished in 60825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 1 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 267 transition count 262
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 267 transition count 262
Applied a total of 14 rules in 4 ms. Remains 267 /274 variables (removed 7) and now considering 262/269 (removed 7) transitions.
[2024-05-28 09:20:41] [INFO ] Invariant cache hit.
[2024-05-28 09:20:41] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 09:20:41] [INFO ] Invariant cache hit.
[2024-05-28 09:20:41] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-28 09:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:43] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:20:44] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:20:45] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-28 09:20:45] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-28 09:20:45] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2024-05-28 09:20:45] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-28 09:20:45] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:20:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:20:45] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:45] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:48] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:20:49] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 4 ms to minimize.
[2024-05-28 09:20:49] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:20:49] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-28 09:20:49] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:20:49] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:20:49] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:20:49] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:20:49] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:20:49] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:20:51] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:20:51] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:20:51] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-28 09:20:51] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:20:51] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:20:51] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:20:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:20:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:20:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:52] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:20:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:20:53] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:20:53] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:20:53] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:20:53] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:20:53] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:56] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:20:56] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:57] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:20:57] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:20:58] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:20:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 262/529 variables, 267/396 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:02] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:21:03] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:21:03] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:21:03] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:21:03] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:21:04] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:21:04] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:21:04] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:21:04] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:21:04] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 2 ms to minimize.
[2024-05-28 09:21:04] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 11/407 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:21:07] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:21:07] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:21:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:21:07] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:21:07] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:21:08] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:21:08] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:21:08] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:21:08] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:21:08] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:21:08] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:21:09] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:21:09] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:21:09] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:21:09] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:21:09] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:21:09] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 18/425 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:10] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:21:11] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:21:11] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:21:11] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/529 variables, and 429 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 116/116 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:13] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:21:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:15] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:21:15] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:21:15] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:21:15] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:21:15] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:21:15] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:21:15] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:21:16] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:17] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:21:17] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:19] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:21:19] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:21:19] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:20] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:21:20] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:21] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 09:21:22] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:21:22] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:21:22] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:21:22] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 5/184 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:23] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 262/529 variables, 267/452 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 261/713 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:29] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-28 09:21:29] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:21:29] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-28 09:21:30] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-28 09:21:30] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-28 09:21:30] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:21:30] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:21:30] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:21:30] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:21:30] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:21:30] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:21:31] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:21:31] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:21:31] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:21:31] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:21:31] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:21:31] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:21:31] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 20/733 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:37] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:21:38] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:21:38] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:21:38] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:21:38] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:21:38] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:21:38] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:21:39] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:21:39] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:21:39] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:21:39] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:21:39] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:21:39] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:21:39] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:21:40] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:21:40] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:21:40] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:21:40] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 751 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 177/177 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 267/274 places, 262/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60373 ms. Remains : 267/274 places, 262/269 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-08 finished in 60565 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&&X(X(G(p1))))))'
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 267 transition count 262
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 267 transition count 262
Applied a total of 14 rules in 8 ms. Remains 267 /274 variables (removed 7) and now considering 262/269 (removed 7) transitions.
[2024-05-28 09:21:41] [INFO ] Invariant cache hit.
[2024-05-28 09:21:41] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 09:21:41] [INFO ] Invariant cache hit.
[2024-05-28 09:21:42] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-28 09:21:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:44] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:21:44] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:21:44] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:21:44] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:21:44] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:21:44] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:21:45] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:21:47] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-28 09:21:47] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:21:47] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-28 09:21:47] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:21:47] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:21:47] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:21:47] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:21:47] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:21:47] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:21:49] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:21:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:21:49] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:21:49] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:21:49] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:21:49] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:21:49] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:21:49] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:21:50] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:51] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-28 09:21:51] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:21:51] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:21:51] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:21:51] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:21:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:21:52] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:21:52] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:21:52] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:21:52] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:52] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:21:53] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:21:53] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:21:53] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:21:53] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:21:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:21:53] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:56] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-28 09:21:56] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:21:57] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:21:57] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:21:59] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 262/529 variables, 267/396 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 11/407 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 18/425 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:22:10] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/529 variables, and 432 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 119/119 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 119/165 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:22:16] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:22:16] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:22:16] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:22:16] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:22:18] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:22:18] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:22:18] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:22:18] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:22:19] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 5/181 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 262/529 variables, 267/448 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 261/709 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:22:24] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-28 09:22:24] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:22:26] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:22:26] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2024-05-28 09:22:26] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:22:26] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:22:26] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-28 09:22:26] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:22:26] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:22:26] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 20/729 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:22:30] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-28 09:22:30] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-28 09:22:31] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-28 09:22:31] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-28 09:22:31] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:22:32] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:22:32] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:22:32] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:22:32] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:22:32] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:22:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:22:33] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:22:33] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:22:33] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:22:34] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:22:34] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-05-28 09:22:34] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 17/746 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 746 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 172/172 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 267/274 places, 262/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60330 ms. Remains : 267/274 places, 262/269 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-11 finished in 60540 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 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 274 transition count 244
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 249 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 248 transition count 243
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 52 place count 248 transition count 217
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 104 place count 222 transition count 217
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 110 place count 216 transition count 211
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 216 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 116 place count 216 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 215 transition count 210
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 292 place count 128 transition count 123
Applied a total of 292 rules in 24 ms. Remains 128 /274 variables (removed 146) and now considering 123/269 (removed 146) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 09:22:42] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:22:42] [INFO ] Implicit Places using invariants in 77 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/274 places, 123/269 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 127/274 places, 123/269 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-12
Product exploration explored 100000 steps with 726 reset in 299 ms.
Product exploration explored 100000 steps with 677 reset in 294 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, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 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 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 127 cols
[2024-05-28 09:22:43] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 09:22:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 09:22:43] [INFO ] Invariant cache hit.
[2024-05-28 09:22:43] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-28 09:22:43] [INFO ] Redundant transitions in 24 ms returned [122]
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 121 sub problems to find dead transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-05-28 09:22:43] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:22:44] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:22:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:22:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:22:44] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:22:44] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:22:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:22:44] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:22:44] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:22:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:22:44] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:22:45] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:22:45] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:22:45] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:22:45] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:22:45] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:22:45] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:22:45] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/249 variables, 127/189 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:22:46] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:22:46] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/249 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:22:47] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 192 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5109 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/194 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 121/315 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:22:50] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:22:50] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:22:50] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:22:51] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:22:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:22:51] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:22:51] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:22:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:22:51] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:22:52] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:22:52] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:22:52] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:22:52] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 13/328 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:22:53] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:22:53] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:22:53] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:22:54] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:22:55] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:22:59] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:22:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:23:00] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:23:00] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:23:00] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/249 variables, 5/338 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:01] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:23:01] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:23:01] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:23:01] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:23:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 5/343 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:04] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:23:04] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:11] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/249 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:17] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/249 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 249/249 variables, and 348 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 55/55 constraints]
After SMT, in 35145ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 35148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/127 places, 122/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35370 ms. Remains : 127/127 places, 122/123 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, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 699 reset in 234 ms.
Product exploration explored 100000 steps with 658 reset in 260 ms.
Built C files in :
/tmp/ltsmin17795770023450853147
[2024-05-28 09:23:20] [INFO ] Computing symmetric may disable matrix : 122 transitions.
[2024-05-28 09:23:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:23:20] [INFO ] Computing symmetric may enable matrix : 122 transitions.
[2024-05-28 09:23:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:23:20] [INFO ] Computing Do-Not-Accords matrix : 122 transitions.
[2024-05-28 09:23:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:23:20] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17795770023450853147
Running compilation step : cd /tmp/ltsmin17795770023450853147;'/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 297 ms.
Running link step : cd /tmp/ltsmin17795770023450853147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17795770023450853147;'/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/stateBased2756202968854153762.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-28 09:23:35] [INFO ] Invariant cache hit.
[2024-05-28 09:23:35] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 09:23:35] [INFO ] Invariant cache hit.
[2024-05-28 09:23:35] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-28 09:23:35] [INFO ] Redundant transitions in 20 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-28 09:23:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:23:36] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/249 variables, 127/189 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:23:37] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:23:37] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:23:37] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:23:37] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:23:37] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:23:37] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:23:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:38] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:23:38] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:39] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:39] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:40] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:40] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:23:41] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:23:41] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:23:41] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:42] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:43] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:44] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:23:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:23:45] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/249 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:45] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/249 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/249 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 20 (OVERLAPS) 0/249 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 212 constraints, problems are : Problem set: 0 solved, 121 unsolved in 11999 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/249 variables, 127/212 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 121/333 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:48] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:23:48] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:23:49] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:23:49] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:23:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:23:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:23:52] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:23:52] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:23:52] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:23:53] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:23:53] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:23:58] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/249 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 346 constraints, problems are : Problem set: 0 solved, 121 unsolved in 17069 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 53/53 constraints]
After SMT, in 29106ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 29108ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29307 ms. Remains : 127/127 places, 122/122 transitions.
Built C files in :
/tmp/ltsmin11573317327816859880
[2024-05-28 09:24:04] [INFO ] Computing symmetric may disable matrix : 122 transitions.
[2024-05-28 09:24:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:24:04] [INFO ] Computing symmetric may enable matrix : 122 transitions.
[2024-05-28 09:24:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:24:04] [INFO ] Computing Do-Not-Accords matrix : 122 transitions.
[2024-05-28 09:24:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:24:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11573317327816859880
Running compilation step : cd /tmp/ltsmin11573317327816859880;'/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 328 ms.
Running link step : cd /tmp/ltsmin11573317327816859880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11573317327816859880;'/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/stateBased9251074668291291317.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:24:19] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:24:19] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:24:19] [INFO ] Time to serialize gal into /tmp/LTL5299238070160449732.gal : 2 ms
[2024-05-28 09:24:19] [INFO ] Time to serialize properties into /tmp/LTL9022462845864930097.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5299238070160449732.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12428017128623658204.hoa' '-atoms' '/tmp/LTL9022462845864930097.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p244==0)||(p108==1))"))))
Formula 0 simplified : FG!"((p244==0)||(p108==1))"
Detected timeout of ITS tools.
[2024-05-28 09:24:49] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:24:49] [INFO ] Applying decomposition
[2024-05-28 09:24:49] [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/graph3673977604924758843.txt' '-o' '/tmp/graph3673977604924758843.bin' '-w' '/tmp/graph3673977604924758843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3673977604924758843.bin' '-l' '-1' '-v' '-w' '/tmp/graph3673977604924758843.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:24:49] [INFO ] Decomposing Gal with order
[2024-05-28 09:24:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:24:49] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-28 09:24:49] [INFO ] Flatten gal took : 11 ms
[2024-05-28 09:24:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 10 ms.
[2024-05-28 09:24:49] [INFO ] Time to serialize gal into /tmp/LTL6957823793970375534.gal : 3 ms
[2024-05-28 09:24:49] [INFO ] Time to serialize properties into /tmp/LTL15196339774310749885.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/LTL6957823793970375534.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15196339774310749885.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.i0.u42.p244==0)||(i1.i2.u17.p108==1))"))))
Formula 0 simplified : FG!"((i4.i0.u42.p244==0)||(i1.i2.u17.p108==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-12 finished in 142510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 273 transition count 243
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 248 transition count 243
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 248 transition count 217
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 222 transition count 217
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 215 transition count 210
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 215 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 116 place count 215 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 214 transition count 209
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 286 place count 130 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 288 place count 128 transition count 123
Applied a total of 288 rules in 23 ms. Remains 128 /274 variables (removed 146) and now considering 123/269 (removed 146) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 09:25:04] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:25:05] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 09:25:05] [INFO ] Invariant cache hit.
[2024-05-28 09:25:05] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-28 09:25:05] [INFO ] Redundant transitions in 22 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-28 09:25:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:25:06] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:25:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:25:06] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:06] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:25:06] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 2/128 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 123/251 variables, 128/205 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:08] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:25:09] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:25:09] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:25:09] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:25:09] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:09] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:25:10] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:10] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:25:10] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:25:10] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:25:10] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:11] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:25:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:25:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:12] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:25:12] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:12] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:25:13] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/251 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/251 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 18 (OVERLAPS) 0/251 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 224 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10591 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 39/75 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/224 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 121/345 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:21] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:25:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:27] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/251 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:30] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:35] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/251 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:25:38] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:25:38] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/251 variables, and 353 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 58/58 constraints]
After SMT, in 40628ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 40629ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/274 places, 123/269 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40866 ms. Remains : 128/274 places, 123/269 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-13
Stuttering criterion allowed to conclude after 316 steps with 3 reset in 2 ms.
FORMULA ShieldIIPs-PT-005B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-13 finished in 40937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 273 transition count 242
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 247 transition count 242
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 247 transition count 216
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 221 transition count 216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 111 place count 214 transition count 209
Iterating global reduction 2 with 7 rules applied. Total rules applied 118 place count 214 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 118 place count 214 transition count 208
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 120 place count 213 transition count 208
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 292 place count 127 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 294 place count 125 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 124 transition count 120
Applied a total of 295 rules in 30 ms. Remains 124 /274 variables (removed 150) and now considering 120/269 (removed 149) transitions.
// Phase 1: matrix 120 rows 124 cols
[2024-05-28 09:25:45] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:25:45] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 09:25:45] [INFO ] Invariant cache hit.
[2024-05-28 09:25:46] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-28 09:25:46] [INFO ] Redundant transitions in 21 ms returned [119]
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 118 sub problems to find dead transitions.
// Phase 1: matrix 119 rows 124 cols
[2024-05-28 09:25:46] [INFO ] Computed 45 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:48] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:25:48] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:25:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:25:48] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:25:48] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:48] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 8/207 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:25:53] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 14 (OVERLAPS) 0/243 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 217 constraints, problems are : Problem set: 0 solved, 118 unsolved in 8701 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 48/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:54] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/218 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/336 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:56] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:25:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:25:59] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 339 constraints, problems are : Problem set: 0 solved, 118 unsolved in 9177 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 52/52 constraints]
After SMT, in 17894ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 17896ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/274 places, 119/269 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18149 ms. Remains : 124/274 places, 119/269 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-14
Product exploration explored 100000 steps with 1713 reset in 237 ms.
Product exploration explored 100000 steps with 1706 reset in 279 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 237 steps (0 resets) in 6 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-28 09:26:04] [INFO ] Invariant cache hit.
[2024-05-28 09:26:04] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:26:04] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-28 09:26:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:26:05] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 09:26:05] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-28 09:26:05] [INFO ] Computed and/alt/rep : 118/287/118 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-28 09:26:05] [INFO ] Added : 103 causal constraints over 22 iterations in 311 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-28 09:26:05] [INFO ] Invariant cache hit.
[2024-05-28 09:26:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 09:26:05] [INFO ] Invariant cache hit.
[2024-05-28 09:26:05] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-28 09:26:05] [INFO ] Redundant transitions in 20 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-28 09:26:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:26:05] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:26:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:07] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:26:07] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:26:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:26:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:26:08] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:26:08] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:26:08] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:08] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:08] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:26:08] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:26:08] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:09] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:26:09] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:10] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:11] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/243 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:12] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:26:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/243 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:13] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 16 (OVERLAPS) 0/243 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 208 constraints, problems are : Problem set: 0 solved, 118 unsolved in 9308 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 39/84 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (OVERLAPS) 119/243 variables, 124/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 118/326 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:26:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 328 constraints, problems are : Problem set: 0 solved, 118 unsolved in 8724 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 41/41 constraints]
After SMT, in 18051ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 18052ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18247 ms. Remains : 124/124 places, 119/119 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 222 steps (0 resets) in 5 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-28 09:26:23] [INFO ] Invariant cache hit.
[2024-05-28 09:26:23] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:26:24] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-28 09:26:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:26:24] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 09:26:24] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-28 09:26:24] [INFO ] Computed and/alt/rep : 118/287/118 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 09:26:24] [INFO ] Added : 103 causal constraints over 22 iterations in 294 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1714 reset in 207 ms.
Product exploration explored 100000 steps with 1714 reset in 222 ms.
Built C files in :
/tmp/ltsmin14993625503772912944
[2024-05-28 09:26:25] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2024-05-28 09:26:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:26:25] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2024-05-28 09:26:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:26:25] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2024-05-28 09:26:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:26:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14993625503772912944
Running compilation step : cd /tmp/ltsmin14993625503772912944;'/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 304 ms.
Running link step : cd /tmp/ltsmin14993625503772912944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14993625503772912944;'/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/stateBased4858417965841259312.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 119/119 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-28 09:26:40] [INFO ] Invariant cache hit.
[2024-05-28 09:26:40] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 09:26:40] [INFO ] Invariant cache hit.
[2024-05-28 09:26:40] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-28 09:26:40] [INFO ] Redundant transitions in 19 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-28 09:26:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:40] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:26:40] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:26:40] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:26:40] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:26:40] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:26:40] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:26:40] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:26:40] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:42] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:26:42] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:26:42] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:26:42] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:26:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:42] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:45] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:46] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/243 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/243 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:48] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 16 (OVERLAPS) 0/243 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 208 constraints, problems are : Problem set: 0 solved, 118 unsolved in 9110 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 39/84 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (OVERLAPS) 119/243 variables, 124/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 118/326 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:26:50] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:26:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 328 constraints, problems are : Problem set: 0 solved, 118 unsolved in 8467 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 41/41 constraints]
After SMT, in 17623ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 17624ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17844 ms. Remains : 124/124 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin10775157075704490788
[2024-05-28 09:26:58] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2024-05-28 09:26:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:26:58] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2024-05-28 09:26:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:26:58] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2024-05-28 09:26:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:26:58] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10775157075704490788
Running compilation step : cd /tmp/ltsmin10775157075704490788;'/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 277 ms.
Running link step : cd /tmp/ltsmin10775157075704490788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10775157075704490788;'/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/stateBased16477182975006040899.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:27:13] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:27:13] [INFO ] Flatten gal took : 5 ms
[2024-05-28 09:27:13] [INFO ] Time to serialize gal into /tmp/LTL12575138259257148745.gal : 2 ms
[2024-05-28 09:27:13] [INFO ] Time to serialize properties into /tmp/LTL18195680626214975376.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12575138259257148745.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18184921647425913076.hoa' '-atoms' '/tmp/LTL18195680626214975376.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("(p31==1)")))
Formula 0 simplified : G!"(p31==1)"
Detected timeout of ITS tools.
[2024-05-28 09:27:43] [INFO ] Flatten gal took : 9 ms
[2024-05-28 09:27:43] [INFO ] Applying decomposition
[2024-05-28 09:27: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/graph15165496491286518331.txt' '-o' '/tmp/graph15165496491286518331.bin' '-w' '/tmp/graph15165496491286518331.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15165496491286518331.bin' '-l' '-1' '-v' '-w' '/tmp/graph15165496491286518331.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:27:43] [INFO ] Decomposing Gal with order
[2024-05-28 09:27:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:27:43] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-28 09:27:43] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:27:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 3 ms.
[2024-05-28 09:27:43] [INFO ] Time to serialize gal into /tmp/LTL11606417249663178900.gal : 2 ms
[2024-05-28 09:27:43] [INFO ] Time to serialize properties into /tmp/LTL11724612693610793360.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/LTL11606417249663178900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11724612693610793360.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("(i0.i2.u5.p31==1)")))
Formula 0 simplified : G!"(i0.i2.u5.p31==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-14 finished in 132478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((G(p1) U G(!p2))))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-005B-LTLCardinality-06
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 274/274 places, 269/269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 273 transition count 243
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 248 transition count 243
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 248 transition count 218
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 223 transition count 218
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 219 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 219 transition count 214
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 280 place count 133 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 282 place count 131 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 283 place count 130 transition count 126
Applied a total of 283 rules in 18 ms. Remains 130 /274 variables (removed 144) and now considering 126/269 (removed 143) transitions.
// Phase 1: matrix 126 rows 130 cols
[2024-05-28 09:27:58] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 09:27:58] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-28 09:27:58] [INFO ] Invariant cache hit.
[2024-05-28 09:27:58] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 09:27:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:27:59] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:27:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:27:59] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:27:59] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:27:59] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:27:59] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:27:59] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:27:59] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 3/130 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:00] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:28:00] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:28:00] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:28:00] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:28:00] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:28:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:28:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:28:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:28:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:28:01] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:01] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 126/256 variables, 130/194 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:02] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:28:02] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:28:02] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:28:02] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:28:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:28:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:28:02] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:28:02] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:28:02] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:03] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:04] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:28:04] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:28:04] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 3 ms to minimize.
[2024-05-28 09:28:04] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:28:04] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:04] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:28:04] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:28:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:28:04] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:28:05] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:28:05] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:05] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/256 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:08] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:28:08] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:28:08] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:28:08] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:28:08] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:28:08] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:28:08] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:28:08] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:28:08] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/256 variables, 9/229 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:10] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/256 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:10] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:28:10] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:28:10] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:28:10] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/256 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/256 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:12] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:28:12] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/256 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/256 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/256 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/256 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 26 (OVERLAPS) 0/256 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 237 constraints, problems are : Problem set: 0 solved, 122 unsolved in 15905 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 52/80 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 3/130 variables, 17/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 126/256 variables, 130/237 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 122/359 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:16] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:19] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:28:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:28:23] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:28:25] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:28:25] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/256 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 365 constraints, problems are : Problem set: 0 solved, 122 unsolved in 23712 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 68/68 constraints]
After SMT, in 39636ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 39637ms
Starting structural reductions in LI_LTL mode, iteration 1 : 130/274 places, 126/269 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 39961 ms. Remains : 130/274 places, 126/269 transitions.
Running random walk in product with property : ShieldIIPs-PT-005B-LTLCardinality-06
Stuttering criterion allowed to conclude after 325 steps with 2 reset in 3 ms.
Treatment of property ShieldIIPs-PT-005B-LTLCardinality-06 finished in 40311 ms.
FORMULA ShieldIIPs-PT-005B-LTLCardinality-06 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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(p0))'
[2024-05-28 09:28:38] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7200742009431755004
[2024-05-28 09:28:38] [INFO ] Applying decomposition
[2024-05-28 09:28:38] [INFO ] Computing symmetric may disable matrix : 269 transitions.
[2024-05-28 09:28:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:28:38] [INFO ] Computing symmetric may enable matrix : 269 transitions.
[2024-05-28 09:28:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:28:38] [INFO ] Flatten gal took : 7 ms
[2024-05-28 09:28:38] [INFO ] Computing Do-Not-Accords matrix : 269 transitions.
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/graph17063449253814062769.txt' '-o' '/tmp/graph17063449253814062769.bin' '-w' '/tmp/graph17063449253814062769.weights'
[2024-05-28 09:28:38] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:28:38] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7200742009431755004
Running compilation step : cd /tmp/ltsmin7200742009431755004;'/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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17063449253814062769.bin' '-l' '-1' '-v' '-w' '/tmp/graph17063449253814062769.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:28:38] [INFO ] Decomposing Gal with order
[2024-05-28 09:28:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:28:38] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-28 09:28:38] [INFO ] Flatten gal took : 42 ms
[2024-05-28 09:28:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 09:28:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality16114206742357129631.gal : 7 ms
[2024-05-28 09:28:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality6444730626967642706.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/LTLCardinality16114206742357129631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6444730626967642706.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("((i9.i0.u82.p244==0)||(i4.i3.u37.p108==1))"))))
Formula 0 simplified : FG!"((i9.i0.u82.p244==0)||(i4.i3.u37.p108==1))"
Compilation finished in 639 ms.
Running link step : cd /tmp/ltsmin7200742009431755004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7200742009431755004;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin7200742009431755004;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7200742009431755004;'/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' '<>((LTLAPp4==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin7200742009431755004;'/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' '<>((LTLAPp4==true))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin7200742009431755004;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 09:54:19] [INFO ] Applying decomposition
[2024-05-28 09:54:19] [INFO ] Flatten gal took : 7 ms
[2024-05-28 09:54:19] [INFO ] Decomposing Gal with order
[2024-05-28 09:54:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:54:19] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-28 09:54:19] [INFO ] Flatten gal took : 33 ms
[2024-05-28 09:54:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 23 ms.
[2024-05-28 09:54:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality12858782212706659892.gal : 3 ms
[2024-05-28 09:54:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality9205919769155125267.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/LTLCardinality12858782212706659892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9205919769155125267.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.u93.p244==0)||(i0.i0.i0.i1.i0.u38.p108==1))"))))
Formula 0 simplified : FG!"((i1.u93.p244==0)||(i0.i0.i0.i1.i0.u38.p108==1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.030: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.055: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.056: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.061: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.061: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.072: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.072: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.069: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.069: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.310: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.310: Initializing POR dependencies: labels 274, guards 269
pins2lts-mc-linux64( 7/ 8), 0.345: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.361: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.470: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.478: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.471: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.480: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.511: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.798: LTL layer: formula: [](<>((LTLAPp3==true)))
pins2lts-mc-linux64( 0/ 8), 0.798: "[](<>((LTLAPp3==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.798: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.881: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 1.263: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.268: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.294: There are 276 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.294: State length is 275, there are 272 groups
pins2lts-mc-linux64( 0/ 8), 1.294: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.294: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.294: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.294: Visible groups: 0 / 272, labels: 1 / 276
pins2lts-mc-linux64( 0/ 8), 1.294: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.294: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.318: [Blue] ~79 levels ~960 states ~1288 transitions
pins2lts-mc-linux64( 0/ 8), 1.379: [Blue] ~163 levels ~1920 states ~2888 transitions
pins2lts-mc-linux64( 2/ 8), 1.536: [Blue] ~480 levels ~3840 states ~7192 transitions
pins2lts-mc-linux64( 4/ 8), 1.709: [Blue] ~778 levels ~7680 states ~14448 transitions
pins2lts-mc-linux64( 0/ 8), 2.129: [Blue] ~933 levels ~15360 states ~25672 transitions
pins2lts-mc-linux64( 2/ 8), 2.625: [Blue] ~987 levels ~30720 states ~47432 transitions
pins2lts-mc-linux64( 2/ 8), 3.452: [Blue] ~987 levels ~61440 states ~96040 transitions
pins2lts-mc-linux64( 4/ 8), 5.748: [Blue] ~778 levels ~122880 states ~158536 transitions
pins2lts-mc-linux64( 3/ 8), 9.509: [Blue] ~788 levels ~245760 states ~334864 transitions
pins2lts-mc-linux64( 3/ 8), 16.113: [Blue] ~788 levels ~491520 states ~667528 transitions
pins2lts-mc-linux64( 3/ 8), 25.527: [Blue] ~788 levels ~983040 states ~1336120 transitions
pins2lts-mc-linux64( 3/ 8), 44.142: [Blue] ~789 levels ~1966080 states ~2693224 transitions
pins2lts-mc-linux64( 3/ 8), 60.283: [Blue] ~814 levels ~3932160 states ~5433632 transitions
pins2lts-mc-linux64( 7/ 8), 89.851: [Blue] ~855 levels ~7864320 states ~11101112 transitions
pins2lts-mc-linux64( 3/ 8), 144.716: [Blue] ~816 levels ~15728640 states ~21933936 transitions
pins2lts-mc-linux64( 7/ 8), 255.981: [Blue] ~878 levels ~31457280 states ~43892232 transitions
pins2lts-mc-linux64( 4/ 8), 479.336: [Blue] ~1581 levels ~62914560 states ~85903800 transitions
pins2lts-mc-linux64( 4/ 8), 930.713: [Blue] ~1581 levels ~125829120 states ~175974608 transitions
pins2lts-mc-linux64( 7/ 8), 1057.202: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1057.248:
pins2lts-mc-linux64( 0/ 8), 1057.248: Explored 121257459 states 146987513 transitions, fanout: 1.212
pins2lts-mc-linux64( 0/ 8), 1057.248: Total exploration time 1055.920 sec (1055.860 sec minimum, 1055.892 sec on average)
pins2lts-mc-linux64( 0/ 8), 1057.248: States per second: 114836, Transitions per second: 139203
pins2lts-mc-linux64( 0/ 8), 1057.248:
pins2lts-mc-linux64( 0/ 8), 1057.248: State space has 134217259 states, 77 are accepting
pins2lts-mc-linux64( 0/ 8), 1057.248: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1057.248: blue states: 121257459 (90.34%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1057.248: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1057.248: all-red states: 77 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1057.248:
pins2lts-mc-linux64( 0/ 8), 1057.248: Total memory used for local state coloring: 192.9MB
pins2lts-mc-linux64( 0/ 8), 1057.248:
pins2lts-mc-linux64( 0/ 8), 1057.248: Queue width: 8B, total height: 12644650, memory: 96.47MB
pins2lts-mc-linux64( 0/ 8), 1057.248: Tree memory: 1068.4MB, 8.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1057.248: Tree fill ratio (roots/leafs): 99.0%/17.0%
pins2lts-mc-linux64( 0/ 8), 1057.248: Stored 270 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1057.248: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1057.248: Est. total memory use: 1164.9MB (~1120.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7200742009431755004;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7200742009431755004;'/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' '[](<>((LTLAPp3==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)
ITS-tools command line returned an error code 137
[2024-05-28 10:09:38] [INFO ] Flatten gal took : 9 ms
[2024-05-28 10:09:38] [INFO ] Input system was already deterministic with 269 transitions.
[2024-05-28 10:09:38] [INFO ] Transformed 274 places.
[2024-05-28 10:09:38] [INFO ] Transformed 269 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 10:09:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality3887342725098837930.gal : 3 ms
[2024-05-28 10:09:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality3804828526965425328.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/LTLCardinality3887342725098837930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3804828526965425328.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...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p244==0)||(p108==1))"))))
Formula 0 simplified : FG!"((p244==0)||(p108==1))"

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-005B"
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-005B, 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-171683760300075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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