Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760200027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPs-PT-002B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760200027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 33K 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-002B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-002B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717223239100

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:27:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:27:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:27:20] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-06-01 06:27:20] [INFO ] Transformed 123 places.
[2024-06-01 06:27:20] [INFO ] Transformed 121 transitions.
[2024-06-01 06:27:20] [INFO ] Found NUPN structural information;
[2024-06-01 06:27:20] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-002B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 114 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 114 transition count 112
Applied a total of 18 rules in 27 ms. Remains 114 /123 variables (removed 9) and now considering 112/121 (removed 9) transitions.
// Phase 1: matrix 112 rows 114 cols
[2024-06-01 06:27:20] [INFO ] Computed 19 invariants in 15 ms
[2024-06-01 06:27:20] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-01 06:27:20] [INFO ] Invariant cache hit.
[2024-06-01 06:27:21] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-06-01 06:27:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 11 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 112/226 variables, 114/181 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:27:27] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:27] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:27:27] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:27] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 9/204 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/226 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/226 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:33] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/226 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/226 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/226 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/226 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/226 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/226 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/226 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/226 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 28 (OVERLAPS) 0/226 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 227 constraints, problems are : Problem set: 0 solved, 111 unsolved in 17542 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:40] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:27:40] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:40] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:40] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 112/226 variables, 114/270 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 111/381 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:44] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:27:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:46] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:46] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:27:47] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:49] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:52] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:54] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:27:54] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:27:57] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/226 variables, 7/398 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:28:00] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/226 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/226 variables, 7/406 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:28:07] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:28:07] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:28:07] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 409 constraints, problems are : Problem set: 0 solved, 111 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 165/165 constraints]
After SMT, in 47625ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 47642ms
Starting structural reductions in LTL mode, iteration 1 : 114/123 places, 112/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48119 ms. Remains : 114/123 places, 112/121 transitions.
Support contains 26 out of 114 places after structural reductions.
[2024-06-01 06:28:09] [INFO ] Flatten gal took : 31 ms
[2024-06-01 06:28:09] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:28:09] [INFO ] Input system was already deterministic with 112 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 2345 steps (6 resets) in 121 ms. (19 steps per ms) remains 0/16 properties
FORMULA ShieldIIPs-PT-002B-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 27 stabilizing places and 27 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(p0) U (!p1 U p2)))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 113 transition count 102
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 104 transition count 102
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 18 place count 104 transition count 91
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 40 place count 93 transition count 91
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 88 transition count 86
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 88 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 88 transition count 85
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 52 place count 87 transition count 85
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 110 place count 58 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 57 transition count 55
Applied a total of 111 rules in 30 ms. Remains 57 /114 variables (removed 57) and now considering 55/112 (removed 57) transitions.
// Phase 1: matrix 55 rows 57 cols
[2024-06-01 06:28:09] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:28:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 06:28:09] [INFO ] Invariant cache hit.
[2024-06-01 06:28:09] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-01 06:28:09] [INFO ] Redundant transitions in 17 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 06:28:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 55/112 variables, 57/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 85 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/57 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 55/112 variables, 57/85 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 53/138 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:28:10] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/112 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 140 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 11/11 constraints]
After SMT, in 2221ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2223ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/114 places, 55/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2374 ms. Remains : 57/114 places, 55/112 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-002B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLCardinality-01 finished in 2696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 109 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 109 transition count 107
Applied a total of 10 rules in 9 ms. Remains 109 /114 variables (removed 5) and now considering 107/112 (removed 5) transitions.
// Phase 1: matrix 107 rows 109 cols
[2024-06-01 06:28:12] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 06:28:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 06:28:12] [INFO ] Invariant cache hit.
[2024-06-01 06:28:12] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 06:28:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/156 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:16] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:28:16] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:28:16] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:28:16] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:16] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:28:17] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/216 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 185 constraints, problems are : Problem set: 0 solved, 106 unsolved in 7099 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:19] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 106/293 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:20] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:28:20] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:28:20] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:22] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:28:22] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:26] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:28] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:31] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:33] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:34] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 4 ms to minimize.
[2024-06-01 06:28:35] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:35] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 17 (OVERLAPS) 0/216 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 316 constraints, problems are : Problem set: 0 solved, 106 unsolved in 21296 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 82/82 constraints]
After SMT, in 28416ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 28420ms
Starting structural reductions in LTL mode, iteration 1 : 109/114 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28551 ms. Remains : 109/114 places, 107/112 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLCardinality-02
Product exploration explored 100000 steps with 1658 reset in 263 ms.
Product exploration explored 100000 steps with 1653 reset in 162 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/109 stabilizing places and 24/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (119 resets) in 205 ms. (194 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (22 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
[2024-06-01 06:28:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 36/216 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 7/19 constraints, State Equation: 0/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 263 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 06:28:41] [INFO ] Invariant cache hit.
[2024-06-01 06:28:41] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:28:41] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-01 06:28:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:28:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:28:42] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-01 06:28:42] [INFO ] Computed and/alt/rep : 106/237/106 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 06:28:42] [INFO ] Added : 85 causal constraints over 17 iterations in 276 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-06-01 06:28:42] [INFO ] Invariant cache hit.
[2024-06-01 06:28:42] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 06:28:42] [INFO ] Invariant cache hit.
[2024-06-01 06:28:42] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 06:28:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/156 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 13 places in 14 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/216 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 185 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6869 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 106/293 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:56] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:57] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:28:58] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:03] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:04] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:04] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:29:05] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 17 (OVERLAPS) 0/216 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 316 constraints, problems are : Problem set: 0 solved, 106 unsolved in 20833 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 82/82 constraints]
After SMT, in 27716ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 27718ms
Finished structural reductions in LTL mode , in 1 iterations and 27833 ms. Remains : 109/109 places, 107/107 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/109 stabilizing places and 24/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 230 steps (0 resets) in 6 ms. (32 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 06:29:10] [INFO ] Invariant cache hit.
[2024-06-01 06:29:10] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-06-01 06:29:10] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 06:29:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:29:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-01 06:29:10] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-01 06:29:10] [INFO ] Computed and/alt/rep : 106/237/106 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 06:29:11] [INFO ] Added : 85 causal constraints over 17 iterations in 268 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1649 reset in 117 ms.
Product exploration explored 100000 steps with 1653 reset in 200 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 107/107 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-06-01 06:29:11] [INFO ] Invariant cache hit.
[2024-06-01 06:29:11] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 06:29:11] [INFO ] Invariant cache hit.
[2024-06-01 06:29:11] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 06:29:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:29:13] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/156 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:17] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:17] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:29:17] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:29:17] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/216 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 185 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6999 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:19] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 106/293 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:29:21] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:22] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:29:22] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:25] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:27] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:29:27] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:29] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:31] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:29:31] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:32] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:29:34] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:29:34] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:29:34] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 17 (OVERLAPS) 0/216 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 316 constraints, problems are : Problem set: 0 solved, 106 unsolved in 21183 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 82/82 constraints]
After SMT, in 28196ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 28198ms
Finished structural reductions in LTL mode , in 1 iterations and 28330 ms. Remains : 109/109 places, 107/107 transitions.
Treatment of property ShieldIIPs-PT-002B-LTLCardinality-02 finished in 88039 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(p1))&&(F(p3)||p2)&&p0)))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 108 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 108 transition count 106
Applied a total of 12 rules in 7 ms. Remains 108 /114 variables (removed 6) and now considering 106/112 (removed 6) transitions.
// Phase 1: matrix 106 rows 108 cols
[2024-06-01 06:29:40] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 06:29:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 06:29:40] [INFO ] Invariant cache hit.
[2024-06-01 06:29:40] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 06:29:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:40] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:29:40] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:29:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:29:40] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:29:40] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:29:40] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:42] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:42] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:29:42] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:29:42] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 106/214 variables, 108/153 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:45] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/214 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:47] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:29:47] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:29:47] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:29:47] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:29:47] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/214 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:47] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/214 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/214 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/214 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/214 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:29:52] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/214 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 25 (OVERLAPS) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 198 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13008 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:53] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/214 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 105/304 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:54] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:29:55] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:29:55] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:29:55] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:00] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:30:02] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:30:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 317 constraints, problems are : Problem set: 0 solved, 105 unsolved in 14399 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 85/85 constraints]
After SMT, in 27418ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 27419ms
Starting structural reductions in LTL mode, iteration 1 : 108/114 places, 106/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27544 ms. Remains : 108/114 places, 106/112 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3)), true, (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLCardinality-03 finished in 27784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 109 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 109 transition count 107
Applied a total of 10 rules in 8 ms. Remains 109 /114 variables (removed 5) and now considering 107/112 (removed 5) transitions.
// Phase 1: matrix 107 rows 109 cols
[2024-06-01 06:30:07] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:30:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 06:30:07] [INFO ] Invariant cache hit.
[2024-06-01 06:30:07] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 06:30:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:10] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:30:10] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:10] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:10] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:12] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:30:12] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 107/216 variables, 109/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:14] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:15] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:30:15] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:30:15] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:30:15] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:15] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:30:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:30:16] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:30:16] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:16] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:17] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/216 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 22 (OVERLAPS) 0/216 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 191 constraints, problems are : Problem set: 0 solved, 106 unsolved in 10638 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/193 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 106/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:19] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:30:20] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:30:20] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:21] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:30:21] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:30:21] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:22] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:30:22] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 33 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 7/317 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:26] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 13 (OVERLAPS) 0/216 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 318 constraints, problems are : Problem set: 0 solved, 106 unsolved in 12746 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 84/84 constraints]
After SMT, in 23396ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 23397ms
Starting structural reductions in LTL mode, iteration 1 : 109/114 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23523 ms. Remains : 109/114 places, 107/112 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLCardinality-06 finished in 23741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 113 transition count 101
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 103 transition count 101
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 103 transition count 90
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 92 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 86 transition count 84
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 86 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 54 place count 86 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 84 transition count 82
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 118 place count 54 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 52 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 51 transition count 50
Applied a total of 121 rules in 26 ms. Remains 51 /114 variables (removed 63) and now considering 50/112 (removed 62) transitions.
// Phase 1: matrix 50 rows 51 cols
[2024-06-01 06:30:31] [INFO ] Computed 18 invariants in 0 ms
[2024-06-01 06:30:31] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 06:30:31] [INFO ] Invariant cache hit.
[2024-06-01 06:30:31] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-06-01 06:30:31] [INFO ] Redundant transitions in 13 ms returned [49]
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 47 sub problems to find dead transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-06-01 06:30:31] [INFO ] Computed 18 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 49/100 variables, 51/76 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 77 constraints, problems are : Problem set: 0 solved, 47 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 49/100 variables, 51/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:30:33] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 125 constraints, problems are : Problem set: 0 solved, 47 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 9/9 constraints]
After SMT, in 1859ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1859ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/114 places, 49/112 transitions.
Applied a total of 0 rules in 5 ms. Remains 51 /51 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2034 ms. Remains : 51/114 places, 49/112 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLCardinality-07
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLCardinality-07 finished in 2093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 113 transition count 101
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 103 transition count 101
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 103 transition count 90
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 92 transition count 90
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 87 transition count 85
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 87 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 52 place count 87 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 85 transition count 83
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 112 place count 57 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 55 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 54 transition count 53
Applied a total of 115 rules in 20 ms. Remains 54 /114 variables (removed 60) and now considering 53/112 (removed 59) transitions.
// Phase 1: matrix 53 rows 54 cols
[2024-06-01 06:30:33] [INFO ] Computed 18 invariants in 0 ms
[2024-06-01 06:30:33] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 06:30:33] [INFO ] Invariant cache hit.
[2024-06-01 06:30:33] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-06-01 06:30:33] [INFO ] Redundant transitions in 17 ms returned [52]
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 49 sub problems to find dead transitions.
// Phase 1: matrix 52 rows 54 cols
[2024-06-01 06:30:33] [INFO ] Computed 18 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:30:34] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:30:34] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:30:34] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:30:34] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:30:34] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 52/106 variables, 54/78 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:30:34] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 79 constraints, problems are : Problem set: 0 solved, 49 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 52/106 variables, 54/79 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 49/128 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:30:35] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:30:35] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/106 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 130 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 9/9 constraints]
After SMT, in 1881ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1882ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/114 places, 52/112 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2022 ms. Remains : 54/114 places, 52/112 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLCardinality-09 finished in 2162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 109 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 109 transition count 107
Applied a total of 10 rules in 6 ms. Remains 109 /114 variables (removed 5) and now considering 107/112 (removed 5) transitions.
// Phase 1: matrix 107 rows 109 cols
[2024-06-01 06:30:35] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:30:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 06:30:35] [INFO ] Invariant cache hit.
[2024-06-01 06:30:36] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 06:30:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:30:36] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:37] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:38] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:30:38] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:30:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:30:38] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/216 variables, 109/157 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:40] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:30:40] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:40] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:30:40] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:43] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:30:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:30:43] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:30:43] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:43] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/216 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 17 (OVERLAPS) 0/216 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9146 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 61/80 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/216 variables, 109/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 106/295 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:30:46] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 7/304 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:49] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:30:49] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 36 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 7/313 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 06:30:53] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/216 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 314 constraints, problems are : Problem set: 0 solved, 106 unsolved in 13374 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 80/80 constraints]
After SMT, in 22531ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 22532ms
Starting structural reductions in LTL mode, iteration 1 : 109/114 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22668 ms. Remains : 109/114 places, 107/112 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLCardinality-10 finished in 22840 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(F(p1))||p0))))'
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 110 transition count 108
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 108
Applied a total of 8 rules in 3 ms. Remains 110 /114 variables (removed 4) and now considering 108/112 (removed 4) transitions.
// Phase 1: matrix 108 rows 110 cols
[2024-06-01 06:30:58] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:30:58] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 06:30:58] [INFO ] Invariant cache hit.
[2024-06-01 06:30:58] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-06-01 06:30:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:31:00] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:31:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:31:00] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:31:00] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:00] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:31:00] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:31:00] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/218 variables, 110/152 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:04] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:04] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:05] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:31:05] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:31:05] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:31:05] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:31:05] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:31:05] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:31:05] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:31:05] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 7/200 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/218 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/218 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:31:09] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:10] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/218 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/218 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 24 (OVERLAPS) 0/218 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 209 constraints, problems are : Problem set: 0 solved, 107 unsolved in 13673 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 80/99 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/218 variables, 110/209 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 107/316 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:31:14] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 6/334 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:19] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:31:19] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:31:19] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:31:19] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:22] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/218 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:24] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:31:24] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 06:31:28] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:31:28] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 16 (OVERLAPS) 0/218 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 344 constraints, problems are : Problem set: 0 solved, 107 unsolved in 21740 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 108/108 constraints]
After SMT, in 35433ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 35435ms
Starting structural reductions in LTL mode, iteration 1 : 110/114 places, 108/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35569 ms. Remains : 110/114 places, 108/112 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 59 ms.
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLCardinality-13 finished in 35955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Found a Shortening insensitive property : ShieldIIPs-PT-002B-LTLCardinality-02
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 113 transition count 101
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 103 transition count 101
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 20 place count 103 transition count 91
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 93 transition count 91
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 88 transition count 86
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 88 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 50 place count 88 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 86 transition count 84
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 116 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 53 transition count 51
Applied a total of 118 rules in 17 ms. Remains 53 /114 variables (removed 61) and now considering 51/112 (removed 61) transitions.
// Phase 1: matrix 51 rows 53 cols
[2024-06-01 06:31:34] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:31:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 06:31:34] [INFO ] Invariant cache hit.
[2024-06-01 06:31:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 06:31:34] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:31:34] [INFO ] Invariant cache hit.
[2024-06-01 06:31:34] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/81 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 88 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1296 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:36] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:31:36] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:31:36] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 141 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 15/15 constraints]
After SMT, in 2446ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2447ms
Starting structural reductions in LI_LTL mode, iteration 1 : 53/114 places, 51/112 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2563 ms. Remains : 53/114 places, 51/112 transitions.
Running random walk in product with property : ShieldIIPs-PT-002B-LTLCardinality-02
Product exploration explored 100000 steps with 5911 reset in 196 ms.
Product exploration explored 100000 steps with 5945 reset in 150 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/53 stabilizing places and 2/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (289 resets) in 112 ms. (353 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
[2024-06-01 06:31:38] [INFO ] Invariant cache hit.
[2024-06-01 06:31:38] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 18/104 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 7/19 constraints, State Equation: 0/53 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 11 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 06:31:38] [INFO ] Invariant cache hit.
[2024-06-01 06:31:38] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:38] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:31:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2024-06-01 06:31:38] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:31:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 06:31:38] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:31:38] [INFO ] Computed and/alt/rep : 49/143/49 causal constraints (skipped 1 transitions) in 2 ms.
[2024-06-01 06:31:38] [INFO ] Added : 46 causal constraints over 10 iterations in 61 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:31:38] [INFO ] Invariant cache hit.
[2024-06-01 06:31:38] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 06:31:38] [INFO ] Invariant cache hit.
[2024-06-01 06:31:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 06:31:38] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:31:38] [INFO ] Invariant cache hit.
[2024-06-01 06:31:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/81 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 88 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1260 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 141 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 15/15 constraints]
After SMT, in 2427ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2428ms
Finished structural reductions in LTL mode , in 1 iterations and 2515 ms. Remains : 53/53 places, 51/51 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/53 stabilizing places and 2/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 67 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 06:31:41] [INFO ] Invariant cache hit.
[2024-06-01 06:31:41] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:41] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:31:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:41] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 06:31:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 06:31:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:31:41] [INFO ] Computed and/alt/rep : 49/143/49 causal constraints (skipped 1 transitions) in 3 ms.
[2024-06-01 06:31:41] [INFO ] Added : 46 causal constraints over 10 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5953 reset in 186 ms.
Product exploration explored 100000 steps with 5958 reset in 174 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:31:42] [INFO ] Invariant cache hit.
[2024-06-01 06:31:42] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 06:31:42] [INFO ] Invariant cache hit.
[2024-06-01 06:31:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 06:31:42] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:31:42] [INFO ] Invariant cache hit.
[2024-06-01 06:31:42] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/81 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 88 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:31:44] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:31:44] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:31:44] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 141 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 15/15 constraints]
After SMT, in 2363ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2363ms
Finished structural reductions in LTL mode , in 1 iterations and 2473 ms. Remains : 53/53 places, 51/51 transitions.
Treatment of property ShieldIIPs-PT-002B-LTLCardinality-02 finished in 10209 ms.
[2024-06-01 06:31:44] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:31:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 06:31:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 114 places, 112 transitions and 344 arcs took 4 ms.
Total runtime 264627 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPs-PT-002B-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717223565726

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPs-PT-002B-LTLCardinality-02
ltl formula formula --ltl=/tmp/3624/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 114 places, 112 transitions and 344 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3624/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3624/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3624/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3624/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 116 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 115, there are 121 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~154 levels ~10000 states ~17464 transitions
pnml2lts-mc( 0/ 4): ~154 levels ~20000 states ~38640 transitions
pnml2lts-mc( 0/ 4): ~154 levels ~40000 states ~80648 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~80000 states ~181268 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~160000 states ~395764 transitions
pnml2lts-mc( 2/ 4): ~153 levels ~320000 states ~785608 transitions
pnml2lts-mc( 2/ 4): ~153 levels ~640000 states ~1618824 transitions
pnml2lts-mc( 2/ 4): ~153 levels ~1280000 states ~3522484 transitions
pnml2lts-mc( 0/ 4): ~154 levels ~2560000 states ~6550220 transitions
pnml2lts-mc( 0/ 4): ~154 levels ~5120000 states ~13525876 transitions
pnml2lts-mc( 0/ 4): ~164 levels ~10240000 states ~27841536 transitions
pnml2lts-mc( 0/ 4): ~164 levels ~20480000 states ~57108204 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552074
pnml2lts-mc( 0/ 4): unique states count: 33552601
pnml2lts-mc( 0/ 4): unique transitions count: 103670466
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 70116170
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552658
pnml2lts-mc( 0/ 4): - cum. max stack depth: 685
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552658 states 103670747 transitions, fanout: 3.090
pnml2lts-mc( 0/ 4): Total exploration time 60.130 sec (60.120 sec minimum, 60.125 sec on average)
pnml2lts-mc( 0/ 4): States per second: 558002, Transitions per second: 1724110
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 261.3MB, 8.2 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/8.0%
pnml2lts-mc( 0/ 4): Stored 112 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 261.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-002B, 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 r528-tall-171683760200027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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